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 30, 2026 20:29Josu San MartinJosu San MartinScore: 4,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:294,27543,892,28734,449,0001,034,0002,113,536
2Aug 30, 2026 20:294,27943,927,90734,481,0001,036,0002,113,536
3Aug 30, 2026 20:294,28043,960,75034,487,0001,040,0002,113,536
4Aug 30, 2026 20:294,28344,044,08234,512,0001,045,0002,113,536
5Aug 30, 2026 20:294,28343,999,15434,520,0001,037,0002,113,536
6Aug 30, 2026 20:294,28543,991,35734,533,0001,034,0002,113,536
7Aug 30, 2026 20:294,29944,160,59234,647,0001,041,0002,113,536
8Aug 30, 2026 20:294,33544,469,39334,855,0001,126,0002,113,536
9Aug 30, 2026 20:294,34644,493,90435,002,0001,073,0002,113,536