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 19:10Teow Hua JunTeow Hua JunScore: 9,457Success
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 19:119,42287,640,19577,144,0001,066,0002,113,536
2Jul 6, 2026 19:119,42387,596,09677,183,0001,034,0002,113,536
3Jul 6, 2026 19:119,42987,665,73177,249,0001,016,0002,113,536
4Jul 6, 2026 19:119,45587,956,61477,398,0001,083,0002,113,536
5Jul 6, 2026 19:119,45788,293,93377,388,0001,113,0002,113,536
6Jul 6, 2026 19:119,46388,285,04177,460,0001,089,0002,113,536
7Jul 6, 2026 19:119,47288,081,97277,521,0001,097,0002,113,536
8Jul 6, 2026 19:119,47589,456,51177,539,0001,106,0002,113,536
9Jul 6, 2026 19:119,48188,092,78377,479,0001,217,0002,113,536