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 19:39Josu San MartinJosu San MartinScore: 16,156Success
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 19:3915,930141,571,816128,852,0003,372,0002,113,536
2Jul 3, 2026 19:3915,994142,130,393129,323,0003,435,0002,113,536
3Jul 3, 2026 19:3916,040142,533,497129,683,0003,453,0002,113,536
4Jul 3, 2026 19:3916,083142,854,920130,034,0003,460,0002,113,536
5Jul 3, 2026 19:3916,156143,465,070130,641,0003,460,0002,113,536
6Jul 3, 2026 19:3916,162143,433,300130,624,0003,525,0002,113,536
7Jul 3, 2026 19:3916,221143,946,777131,086,0003,556,0002,113,536
8Jul 3, 2026 19:3916,399145,516,991132,608,0003,510,0002,113,536
9Jul 3, 2026 19:3916,490146,240,674133,309,0003,564,0002,113,536