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 10, 2026 08:55poyo180605poyo180605Score: 47,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 08:5547,217411,542,575334,918,00056,986,0002,265,088
2Apr 10, 2026 08:5547,227411,528,962328,989,00062,997,0002,510,848
3Apr 10, 2026 08:5547,237416,914,318334,059,00058,010,0002,510,848
4Apr 10, 2026 08:5547,261414,691,224332,228,00060,041,0002,289,664
5Apr 10, 2026 08:5547,277426,205,551334,341,00058,059,0002,289,664
6Apr 10, 2026 08:5547,328421,760,046330,848,00061,971,0002,523,136
7Apr 10, 2026 08:5547,329416,017,820336,855,00055,976,0002,289,664
8Apr 10, 2026 08:5547,334419,598,561331,894,00060,980,0002,269,184
9Apr 10, 2026 08:5547,472417,511,539334,014,00060,002,0002,289,664