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 05:50wnwnScore: 3,464Success
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 05:513,39943,019,36827,206,0001,007,0002,490,368
2Apr 27, 2026 05:513,40247,659,74127,233,0001,008,0002,486,272
3Apr 27, 2026 05:513,40841,015,81027,282,0001,010,0002,482,176
4Apr 27, 2026 05:513,44550,362,28827,573,0001,021,0002,490,368
5Apr 27, 2026 05:513,46448,368,76426,773,0001,983,0002,490,368
6Apr 27, 2026 05:513,51743,488,14428,188,0001,006,0002,494,464
7Apr 27, 2026 05:513,59145,014,58927,820,0001,987,0002,330,624
8Apr 27, 2026 05:513,59647,337,09027,861,0001,990,0002,482,176
9Apr 27, 2026 05:513,62245,503,03828,061,0002,004,0002,478,080