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 listJul 20, 2026 21:16allllekssssaallllekssssaScore: 215,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 21:16215,5361,799,478,0981,723,880,00065,071,0002,113,536
2Jul 20, 2026 21:16215,5781,802,959,3271,724,167,00065,131,0002,113,536
3Jul 20, 2026 21:16215,5841,799,405,7421,724,279,00065,069,0002,113,536
4Jul 20, 2026 21:16215,6211,799,499,3651,723,557,00066,104,0002,113,536
5Jul 20, 2026 21:16215,6641,800,563,2251,723,890,00066,124,0002,113,536
6Jul 20, 2026 21:16215,6961,800,845,3271,724,154,00066,131,0002,113,536
7Jul 20, 2026 21:16215,8411,801,390,4071,724,370,00067,111,0002,113,536
8Jul 20, 2026 21:16216,0031,803,113,5311,723,622,00069,205,0002,113,536
9Jul 20, 2026 21:16221,8171,850,994,7841,771,980,00069,106,0002,113,536