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 18, 2026 19:05Adam FolwarcznyAdam FolwarcznyScore: 58,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 19:0558,747497,567,496486,605,0001,002,0002,113,536
2Jul 18, 2026 19:0558,765497,591,757485,737,0002,014,0002,113,536
3Jul 18, 2026 19:0558,773497,580,917486,813,0001,004,0002,113,536
4Jul 18, 2026 19:0558,785497,882,119485,883,0002,036,0002,113,536
5Jul 18, 2026 19:0558,828498,039,010487,277,0001,002,0002,113,536
6Jul 18, 2026 19:0558,871498,410,399487,629,0001,004,0002,113,536
7Jul 18, 2026 19:0558,967499,284,986488,429,0001,002,0002,113,536
8Jul 18, 2026 19:0558,973499,342,622487,453,0002,028,0002,113,536
9Jul 18, 2026 19:0558,981499,942,254487,538,0002,006,0002,113,536