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 7, 2026 15:55Jarry XiaoJarry XiaoScore: 58,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 15:5558,157492,288,842419,434,00063,270,0002,117,632
2Jul 7, 2026 15:5558,171492,447,338419,802,00063,023,0002,117,632
3Jul 7, 2026 15:5558,183492,566,370419,778,00063,147,0002,117,632
4Jul 7, 2026 15:5558,193494,500,120419,831,00063,172,0002,117,632
5Jul 7, 2026 15:5558,261494,505,551419,680,00063,893,0002,117,632
6Jul 7, 2026 15:5558,264493,152,021419,443,00064,149,0002,117,632
7Jul 7, 2026 15:5558,285493,342,321420,269,00063,501,0002,117,632
8Jul 7, 2026 15:5558,328493,787,090420,328,00063,797,0002,117,632
9Jul 7, 2026 15:5558,351493,852,434420,976,00063,343,0002,117,632