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 listApr 27, 2026 21:31Victor MerckléVictor MerckléScore: 19,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 21:3219,328173,743,010159,423,0001,002,0002,482,176
2Apr 27, 2026 21:3219,337177,736,774159,495,0001,003,0002,375,680
3Apr 27, 2026 21:3219,337181,822,379159,499,0001,003,0002,310,144
4Apr 27, 2026 21:3219,361186,007,725158,708,0001,996,0002,379,776
5Apr 27, 2026 21:3219,377178,558,704158,838,0001,997,0002,375,680
6Apr 27, 2026 21:3219,382180,509,386159,873,000999,0002,375,680
7Apr 27, 2026 21:3219,399179,134,327160,017,0001,000,0002,322,432
8Apr 27, 2026 21:3219,481178,095,635159,704,0001,996,0002,375,680
9Apr 27, 2026 21:3219,514181,973,301159,971,0001,999,0002,387,968