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 29, 2026 16:43Josu San MartinJosu San MartinScore: 4,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:454,83248,539,04338,978,0001,133,0002,113,536
2Aug 29, 2026 16:454,84348,565,78439,078,0001,120,0002,113,536
3Aug 29, 2026 16:454,84348,616,73439,086,0001,111,0002,113,536
4Aug 29, 2026 16:454,84748,586,91439,122,0001,113,0002,113,536
5Aug 29, 2026 16:454,85748,687,32439,183,0001,137,0002,113,536
6Aug 29, 2026 16:454,86048,723,87939,192,0001,147,0002,113,536
7Aug 29, 2026 16:454,87448,761,06239,342,0001,117,0002,113,536
8Aug 29, 2026 16:455,02250,145,24340,567,0001,121,0002,113,536
9Aug 29, 2026 16:455,04650,298,59240,740,0001,142,0002,113,536