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 19, 2026 01:46e1011e1011Score: 413,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 01:47412,6163,434,698,4083,354,463,00070,256,0002,113,536
2Jul 19, 2026 01:47412,6213,434,654,9033,355,616,00069,146,0002,113,536
3Jul 19, 2026 01:47412,6893,435,166,5373,356,266,00069,057,0002,113,536
4Jul 19, 2026 01:47412,9003,437,072,8293,358,014,00069,059,0002,113,536
5Jul 19, 2026 01:47413,0753,438,460,3613,357,467,00071,058,0002,113,536
6Jul 19, 2026 01:47413,6213,442,992,7223,362,921,00070,140,0002,113,536
7Jul 19, 2026 01:47414,6523,451,880,8743,370,565,00071,047,0002,113,536
8Jul 19, 2026 01:47415,1773,456,304,4063,375,914,00070,060,0002,113,536
9Jul 19, 2026 01:47416,2583,466,073,4673,384,889,00070,058,0002,113,536