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 listSep 12, 2026 14:55Kevin HeaveyKevin HeaveyScore: 3,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 14:563,64240,437,56329,192,0001,041,0002,117,632
2Sep 12, 2026 14:563,64940,509,04829,051,0001,242,0002,117,632
3Sep 12, 2026 14:563,65140,599,41229,102,0001,202,0002,117,632
4Sep 12, 2026 14:563,81741,918,17030,649,0001,039,0002,117,632
5Sep 12, 2026 14:563,84742,114,50630,708,0001,224,0002,117,632
6Sep 12, 2026 14:563,86842,336,21031,071,0001,040,0002,117,632
7Sep 12, 2026 14:563,90144,407,09631,343,0001,039,0002,117,632
8Sep 12, 2026 14:563,93142,918,58531,597,0001,038,0002,117,632
9Sep 12, 2026 14:563,95043,131,98331,548,0001,237,0002,117,632