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 9, 2026 23:43Elnur RakhmatullinElnur RakhmatullinScore: 13,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 23:4413,033117,685,483106,018,0002,157,0002,113,536
2Jul 9, 2026 23:4413,040117,726,516106,028,0002,204,0002,113,536
3Jul 9, 2026 23:4413,043117,806,226106,029,0002,231,0002,113,536
4Jul 9, 2026 23:4413,044117,751,789106,012,0002,257,0002,113,536
5Jul 9, 2026 23:4413,045117,781,857106,021,0002,260,0002,113,536
6Jul 9, 2026 23:4413,046117,826,170106,041,0002,245,0002,113,536
7Jul 9, 2026 23:4413,048117,836,010106,065,0002,238,0002,113,536
8Jul 9, 2026 23:4413,056117,842,373106,011,0002,357,0002,113,536
9Jul 9, 2026 23:4413,058117,906,150106,069,0002,316,0002,113,536