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 17, 2026 21:12wnwnScore: 10,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 21:129,852111,620,13579,775,0001,994,0002,273,280
2Feb 17, 2026 21:129,853108,681,52479,782,0001,994,0002,289,664
3Feb 17, 2026 21:129,855111,799,61080,803,000997,0002,273,280
4Feb 17, 2026 21:1210,988113,008,67489,198,0002,004,0002,293,760
5Feb 17, 2026 21:1211,181114,479,53890,805,0001,995,0002,277,376
6Feb 17, 2026 21:1211,206118,866,24991,009,0002,000,0002,293,760