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 listMay 10, 2026 13:34Josu San MartinJosu San MartinScore: 4,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:344,29843,253,27534,636,0001,044,0002,113,536
2May 10, 2026 13:344,31245,439,22734,753,0001,037,0002,113,536
3May 10, 2026 13:344,31343,750,23434,750,0001,055,0002,113,536
4May 10, 2026 13:344,31445,959,06834,755,0001,052,0002,113,536
5May 10, 2026 13:344,32043,150,64934,809,0001,051,0002,113,536
6May 10, 2026 13:344,32343,725,23834,841,0001,044,0002,113,536
7May 10, 2026 13:344,33245,961,50934,799,0001,158,0002,113,536
8May 10, 2026 13:344,34045,421,85234,984,0001,040,0002,113,536
9May 10, 2026 13:344,40944,599,30435,543,0001,059,0002,113,536