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 listMay 20, 2026 09:33Victor MerckléVictor MerckléScore: 6,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 09:356,02957,881,52249,021,0001,023,0002,113,536
2May 20, 2026 09:356,03359,483,66849,047,0001,034,0002,113,536
3May 20, 2026 09:356,03657,673,24149,093,0001,006,0002,113,536
4May 20, 2026 09:356,04157,869,24349,110,0001,036,0002,113,536
5May 20, 2026 09:356,05757,822,44849,246,0001,030,0002,113,536
6May 20, 2026 09:356,15060,579,52750,025,0001,026,0002,113,536
7May 20, 2026 09:356,17058,956,86350,179,0001,032,0002,113,536
8May 20, 2026 09:356,20059,136,96950,461,0001,005,0002,113,536
9May 20, 2026 09:356,23860,663,38050,741,0001,037,0002,113,536