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 3, 2026 20:46Josu San MartinJosu San MartinScore: 6,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:476,37162,666,94348,639,0004,247,0002,113,536
2Jul 3, 2026 20:476,37562,365,70748,767,0004,153,0002,113,536
3Jul 3, 2026 20:476,38062,302,87948,734,0004,228,0002,113,536
4Jul 3, 2026 20:476,42362,713,46149,103,0004,214,0002,113,536
5Jul 3, 2026 20:476,42462,739,91349,051,0004,276,0002,113,536
6Jul 3, 2026 20:476,44662,842,60449,242,0004,265,0002,113,536
7Jul 3, 2026 20:476,45062,853,97349,417,0004,121,0002,113,536
8Jul 3, 2026 20:476,45563,344,92348,393,0005,186,0002,113,536
9Jul 3, 2026 20:476,49263,262,20448,630,0005,256,0002,113,536