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 18:30Victor MerckléVictor MerckléScore: 3,766Success
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 18:303,74939,401,36329,966,0001,158,0002,113,536
2Aug 27, 2026 18:303,74940,174,27529,982,0001,135,0002,113,536
3Aug 27, 2026 18:303,75139,314,62930,003,0001,138,0002,113,536
4Aug 27, 2026 18:303,75939,474,18230,132,0001,068,0002,113,536
5Aug 27, 2026 18:303,76640,335,56830,234,0001,032,0002,113,536
6Aug 27, 2026 18:303,86240,420,46830,884,0001,176,0002,113,536
7Aug 27, 2026 18:303,91841,539,49331,345,0001,176,0002,113,536
8Aug 27, 2026 18:304,01941,627,73132,289,0001,071,0002,113,536
9Aug 27, 2026 18:304,08142,898,73032,823,0001,056,0002,113,536