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 listOct 14, 2026 22:45e1011e1011Score: 65,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 22:4665,883558,233,706492,660,00054,177,0002,113,536
2Oct 14, 2026 22:4665,910557,970,686492,775,00054,279,0002,113,536
3Oct 14, 2026 22:4665,912558,316,261492,844,00054,228,0002,113,536
4Oct 14, 2026 22:4665,944558,792,902492,993,00054,343,0002,113,536
5Oct 14, 2026 22:4665,945558,554,623493,065,00054,281,0002,113,536
6Oct 14, 2026 22:4665,969558,749,006493,145,00054,401,0002,113,536
7Oct 14, 2026 22:4666,000558,375,393493,600,00054,206,0002,113,536
8Oct 14, 2026 22:4666,002558,534,712493,432,00054,388,0002,113,536
9Oct 14, 2026 22:4666,011559,251,789493,658,00054,237,0002,113,536