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 29, 2026 18:55Danylo MocherniukDanylo MocherniukScore: 10,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 18:5510,408107,284,29285,379,0001,004,0002,293,760
2Mar 29, 2026 18:5510,495110,551,51986,107,0001,001,0002,510,848
3Mar 29, 2026 18:5510,521115,138,60286,322,0001,003,0002,506,752
4Mar 29, 2026 18:5510,525111,338,74986,352,0001,004,0002,293,760
5Mar 29, 2026 18:5510,529113,111,92886,387,0001,004,0002,342,912
6Mar 29, 2026 18:5510,539112,752,41487,470,00002,506,752
7Mar 29, 2026 18:5510,542110,963,26986,491,0001,005,0002,351,104
8Mar 29, 2026 18:5510,552113,858,45886,573,0001,006,0002,293,760
9Mar 29, 2026 18:5510,554118,696,97286,592,0001,006,0002,506,752