Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listNov 5, 2025 17:25dhathorndhathornScore: 154,718Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 17:25154,6471,310,749,0021,185,607,00097,967,0002,326,528
2Nov 5, 2025 17:25154,6531,308,301,9001,189,645,00093,971,0002,445,312
3Nov 5, 2025 17:25154,6621,308,110,0571,175,718,000107,974,0002,449,408
4Nov 5, 2025 17:25154,6671,309,336,2261,200,754,00082,983,0002,326,528
5Nov 5, 2025 17:25154,7181,314,673,9671,189,221,00094,937,0002,326,528
6Nov 5, 2025 17:25154,8341,316,756,8961,201,182,00083,942,0002,441,216
7Nov 5, 2025 17:25154,9281,319,637,5251,202,907,00082,993,0002,326,528
8Nov 5, 2025 17:25155,0491,321,677,5511,178,829,000108,076,0002,441,216
9Nov 5, 2025 17:25155,1101,313,745,5191,194,456,00092,957,0002,326,528