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 18:28Josu San MartinJosu San MartinScore: 13,299Success
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 18:2813,217119,683,828102,705,0006,997,0002,121,728
2Jul 3, 2026 18:2813,237119,283,013102,972,0006,896,0002,117,632
3Jul 3, 2026 18:2813,241119,248,263103,186,0006,719,0002,113,536
4Jul 3, 2026 18:2813,244119,245,884103,143,0006,786,0002,121,728
5Jul 3, 2026 18:2813,299119,782,936103,688,0006,700,0002,121,728
6Jul 3, 2026 18:2813,316119,882,836103,672,0006,852,0002,121,728
7Jul 3, 2026 18:2813,375120,318,849104,274,0006,743,0002,117,632
8Jul 3, 2026 18:2813,587122,152,505106,014,0006,765,0002,121,728
9Jul 3, 2026 18:2813,703123,056,271106,982,0006,758,0002,117,632