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 3, 2026 12:57RuszrokRuszrokScore: 31,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 12:5730,936278,754,962254,773,0001,998,0002,404,352
2Feb 3, 2026 12:5730,944278,230,389254,835,0001,998,0002,396,160
3Feb 3, 2026 12:5730,963280,438,048255,990,000999,0002,392,064
4Feb 3, 2026 12:5730,971286,468,146255,058,0002,000,0002,400,256
5Feb 3, 2026 12:5731,031288,808,065256,555,0001,002,0002,277,376
6Feb 3, 2026 12:5731,049280,116,423256,705,000998,0002,400,256
7Feb 3, 2026 12:5731,055284,960,623256,759,000999,0002,408,448
8Feb 3, 2026 12:5731,071278,810,768255,889,0001,999,0002,277,376
9Feb 3, 2026 12:5731,092280,691,820257,065,0001,000,0002,277,376