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 listFeb 15, 2026 23:16wnwnScore: 9,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:168,11091,381,23560,283,0007,033,0002,465,792
2Feb 15, 2026 23:168,19596,391,10961,017,0007,002,0002,285,568
3Feb 15, 2026 23:168,30289,807,89858,921,0009,986,0002,465,792
4Feb 15, 2026 23:169,850112,220,33372,780,0008,972,0002,478,080
5Feb 15, 2026 23:169,862106,074,31773,867,0007,985,0002,412,544
6Feb 15, 2026 23:169,948106,428,43077,538,0005,034,0002,363,392