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 6, 2026 00:49TonyTonyScore: 8,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 00:507,99276,156,49763,685,0002,654,0002,113,536
2Aug 6, 2026 00:508,02876,455,32264,584,0002,055,0002,113,536
3Aug 6, 2026 00:508,03476,459,89864,036,0002,652,0002,113,536
4Aug 6, 2026 00:508,03876,515,79964,050,0002,669,0002,113,536
5Aug 6, 2026 00:508,04076,577,82264,062,0002,670,0002,113,536
6Aug 6, 2026 00:508,06676,782,10664,281,0002,675,0002,113,536
7Aug 6, 2026 00:508,08776,951,02164,507,0002,620,0002,113,536
8Aug 6, 2026 00:508,10277,172,48064,557,0002,692,0002,113,536
9Aug 6, 2026 00:508,16178,844,60665,056,0002,682,0002,113,536