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 6, 2026 14:18Teow Hua JunTeow Hua JunScore: 11,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:2111,657106,154,56295,542,0001,216,0002,113,536
2Jul 6, 2026 14:2111,681106,552,13995,753,0001,203,0002,113,536
3Jul 6, 2026 14:2111,688106,395,76895,812,0001,204,0002,113,536
4Jul 6, 2026 14:2111,701106,576,27195,905,0001,214,0002,113,536
5Jul 6, 2026 14:2111,703106,561,18696,000,0001,136,0002,113,536
6Jul 6, 2026 14:2111,705106,626,27696,030,0001,128,0002,113,536
7Jul 6, 2026 14:2111,708106,569,94295,966,0001,217,0002,113,536
8Jul 6, 2026 14:2111,730106,759,39096,137,0001,227,0002,113,536
9Jul 6, 2026 14:2111,750106,936,15696,521,0001,010,0002,113,536