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 listJan 1, 2026 20:16Josu San MartinJosu San MartinScore: 6,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:166,28277,900,32051,136,0001,002,0002,347,008
2Jan 1, 2026 20:166,29477,560,63549,230,0003,014,0002,469,888
3Jan 1, 2026 20:166,29674,861,55750,244,0002,009,0002,453,504
4Jan 1, 2026 20:166,57579,229,48150,532,0004,042,0002,293,760
5Jan 1, 2026 20:166,58881,492,18352,654,0002,025,0002,347,008
6Jan 1, 2026 20:166,61877,030,07351,937,0002,996,0002,453,504