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 listAug 27, 2026 16:54Victor MerckléVictor MerckléScore: 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
1Aug 27, 2026 16:563,76839,610,77730,084,0001,191,0002,113,536
2Aug 27, 2026 16:563,79640,553,06530,239,0001,268,0002,113,536
3Aug 27, 2026 16:563,80040,628,58130,264,0001,283,0002,113,536
4Aug 27, 2026 16:563,80639,892,15230,328,0001,265,0002,113,536
5Aug 27, 2026 16:563,80840,680,67130,327,0001,284,0002,113,536
6Aug 27, 2026 16:563,81940,057,09530,457,0001,243,0002,113,536
7Aug 27, 2026 16:563,96441,931,74031,641,0001,264,0002,113,536
8Aug 27, 2026 16:563,99742,180,94031,991,0001,187,0002,113,536
9Aug 27, 2026 16:564,00342,175,20232,014,0001,218,0002,113,536