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 27, 2026 13:57Sergey SerebryakovSergey SerebryakovScore: 6,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:576,58082,038,29054,615,00002,379,776
2Mar 27, 2026 13:576,60683,199,49954,826,00002,379,776
3Mar 27, 2026 13:576,60981,983,84852,857,0001,994,0002,363,392
4Mar 27, 2026 13:576,61483,723,91552,897,0001,996,0002,375,680
5Mar 27, 2026 13:576,61681,086,01453,917,000998,0002,383,872
6Mar 27, 2026 13:576,63579,210,94054,066,0001,001,0002,375,680
7Mar 27, 2026 13:576,70591,742,25355,648,00002,306,048
8Mar 27, 2026 13:576,78080,646,05656,272,00002,306,048
9Mar 27, 2026 13:576,79379,449,45456,383,00002,375,680