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 listJul 28, 2025 01:43Marco BarboneMarco BarboneScore: 273,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 01:43219,1541,847,075,7081,816,981,0001,998,0002,273,280
2Jul 28, 2025 01:43273,1482,293,930,8122,265,129,0001,999,0002,523,136
3Jul 28, 2025 01:43283,9152,386,305,7472,352,501,0003,997,0002,531,328