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 18, 2026 15:26wnwnScore: 7,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:267,35685,399,26159,054,0002,001,0002,539,520
2Feb 18, 2026 15:267,36986,497,02059,154,0002,005,0002,281,472
3Feb 18, 2026 15:267,38583,730,93859,283,0002,009,0002,514,944
4Feb 18, 2026 15:267,39481,377,25660,361,0001,006,0002,519,040
5Feb 18, 2026 15:267,39782,620,22861,398,00002,441,216
6Feb 18, 2026 15:267,40688,587,43860,462,0001,007,0002,277,376