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 16:00Kevin HeaveyKevin HeaveyScore: 3,808Success
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 16:023,54638,301,62428,334,0001,099,0002,113,536
2Sep 12, 2026 16:023,57638,545,05428,624,0001,059,0002,113,536
3Sep 12, 2026 16:023,58538,603,77028,716,0001,043,0002,113,536
4Sep 12, 2026 16:023,70139,575,19729,494,0001,227,0002,113,536
5Sep 12, 2026 16:023,80841,809,11930,375,0001,238,0002,113,536
6Sep 12, 2026 16:023,81640,509,89330,643,0001,032,0002,113,536
7Sep 12, 2026 16:023,83440,734,79930,784,0001,039,0002,113,536
8Sep 12, 2026 16:023,84140,649,85330,665,0001,216,0002,113,536
9Sep 12, 2026 16:023,85340,861,49730,912,0001,074,0002,113,536