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 listSep 24, 2026 02:51wnwnScore: 5,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 02:565,23252,149,97327,209,00016,219,0002,113,536
2Sep 24, 2026 02:565,30552,817,95228,179,00015,856,00020,480
3Sep 24, 2026 02:565,34553,126,21627,241,00017,124,00020,480
4Sep 24, 2026 02:565,39353,548,16426,986,00017,784,00020,480
5Sep 24, 2026 02:565,44654,604,89428,449,00016,761,00020,480
6Sep 24, 2026 02:565,50654,617,86527,675,00018,029,0002,113,536
7Sep 24, 2026 02:565,51855,241,86528,133,00017,672,00020,480
8Sep 24, 2026 02:565,66555,778,97226,967,00020,057,0002,113,536
9Sep 24, 2026 02:565,72656,282,04726,745,00020,782,0002,113,536