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 listApr 27, 2026 10:19wnwnScore: 3,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:193,39545,424,78327,180,0001,006,0002,478,080
2Apr 27, 2026 10:193,40447,291,86727,248,0001,009,0002,490,368
3Apr 27, 2026 10:193,44945,954,67927,607,0001,022,0002,486,272
4Apr 27, 2026 10:193,45145,255,48627,624,0001,023,0002,330,624
5Apr 27, 2026 10:193,46740,874,86526,797,0001,985,0002,486,272
6Apr 27, 2026 10:193,48644,161,36026,942,0001,995,0002,330,624
7Apr 27, 2026 10:193,50547,510,45527,093,0002,006,0002,490,368
8Apr 27, 2026 10:193,56242,200,28929,571,00002,490,368
9Apr 27, 2026 10:193,59144,464,99327,820,0001,987,0002,314,240