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 7, 2026 18:51Benn TanBenn TanScore: 10,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:518,637102,172,18571,688,00002,277,376
2Feb 7, 2026 18:518,65196,603,89269,813,0001,994,0002,392,064
3Feb 7, 2026 18:518,95993,387,63474,359,00002,510,848
4Feb 7, 2026 18:5110,609116,061,73686,053,0002,001,0002,273,280
5Feb 7, 2026 18:5110,611117,083,85187,071,0001,000,0002,506,752
6Feb 7, 2026 18:5110,623109,819,39686,171,0002,003,0002,514,944