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 27, 2026 19:53boop34boop34Score: 8,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 19:548,84583,239,46172,396,0001,023,0002,113,536
2Jul 27, 2026 19:548,87583,429,20072,643,0001,023,0002,113,536
3Jul 27, 2026 19:548,87983,427,32472,678,0001,023,0002,113,536
4Jul 27, 2026 19:548,88283,548,35372,698,0001,023,0002,113,536
5Jul 27, 2026 19:548,88383,793,84272,708,0001,022,0002,113,536
6Jul 27, 2026 19:548,89483,638,67072,803,0001,022,0002,113,536
7Jul 27, 2026 19:548,90685,346,48472,899,0001,023,0002,113,536
8Jul 27, 2026 19:548,91283,822,96272,953,0001,023,0002,113,536
9Jul 27, 2026 19:548,95084,141,18573,271,0001,021,0002,113,536