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 08:16Teow Hua JunTeow Hua JunScore: 12,570Success
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 08:1712,563113,732,554103,179,0001,098,0002,113,536
2Jul 6, 2026 08:1712,568113,819,036103,149,0001,168,0002,113,536
3Jul 6, 2026 08:1712,569113,675,599103,183,0001,147,0002,113,536
4Jul 6, 2026 08:1712,569113,772,918103,207,0001,121,0002,113,536
5Jul 6, 2026 08:1712,570113,724,543103,150,0001,181,0002,113,536
6Jul 6, 2026 08:1712,583113,867,657103,265,0001,174,0002,113,536
7Jul 6, 2026 08:1712,586113,914,553103,294,0001,177,0002,113,536
8Jul 6, 2026 08:1712,590113,889,779103,498,0001,006,0002,113,536
9Jul 6, 2026 08:1712,643114,319,651103,763,0001,177,0002,113,536