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 listMar 6, 2026 18:24wnwnScore: 4,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 18:244,31860,838,49833,848,0001,991,0002,494,464
2Mar 6, 2026 18:264,33958,925,39334,016,0002,000,0002,527,232
3Mar 6, 2026 18:244,34356,428,92234,047,0002,002,0002,273,280
4Mar 6, 2026 18:264,34365,254,48434,048,0002,002,0002,273,280
5Mar 6, 2026 18:244,34557,234,98534,058,0002,003,0002,273,280
6Mar 6, 2026 18:244,34956,715,12934,091,0002,005,0002,273,280
7Mar 6, 2026 18:264,35157,081,00534,104,0002,006,0002,486,272
8Mar 6, 2026 18:244,36657,103,80734,228,0002,013,0002,498,560
9Mar 6, 2026 18:2410,766111,427,41288,354,0001,004,0002,273,280