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 14, 2026 13:26Juraj ZelmanJuraj ZelmanScore: 31,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 13:2631,189283,390,247257,866,000999,0002,285,568
2Feb 14, 2026 13:2631,203283,952,111256,982,0001,999,0002,289,664
3Feb 14, 2026 13:2631,206282,325,267257,008,0002,000,0002,367,488
4Feb 14, 2026 13:2631,207286,957,487258,015,0001,000,0002,367,488
5Feb 14, 2026 13:2631,211282,488,559258,048,0001,000,0002,367,488
6Feb 14, 2026 13:2631,222282,681,321257,139,0002,001,0002,371,584
7Feb 14, 2026 13:2631,225284,793,896257,166,0002,001,0002,371,584
8Feb 14, 2026 13:2631,236280,667,446258,260,0001,001,0002,359,296
9Feb 14, 2026 13:2631,241284,086,197258,299,0001,001,0002,363,392