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 listAug 3, 2026 14:59Teow Hua JunTeow Hua JunScore: 10,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 15:0010,54697,421,30786,451,0001,084,0002,113,536
2Aug 3, 2026 15:0010,54797,433,97586,462,0001,080,0002,113,536
3Aug 3, 2026 15:0010,54897,918,28986,450,0001,101,0002,113,536
4Aug 3, 2026 15:0010,55097,448,80486,468,0001,099,0002,113,536
5Aug 3, 2026 15:0010,55399,424,01686,515,0001,076,0002,113,536
6Aug 3, 2026 15:0010,55497,374,74286,521,0001,085,0002,113,536
7Aug 3, 2026 15:0010,55497,464,50786,530,0001,074,0002,113,536
8Aug 3, 2026 15:0010,55797,522,99986,537,0001,090,0002,113,536
9Aug 3, 2026 15:0010,55897,527,76586,487,0001,152,0002,113,536