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 04:48wnwnScore: 3,469Success
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 04:483,39945,982,00927,210,0001,007,0002,486,272
2Apr 27, 2026 04:483,44242,783,47827,549,0001,020,0002,326,528
3Apr 27, 2026 04:483,46345,334,83527,718,0001,026,0002,314,240
4Apr 27, 2026 04:483,46446,376,24426,775,0001,983,0002,486,272
5Apr 27, 2026 04:483,46946,659,11626,809,0001,985,0002,486,272
6Apr 27, 2026 04:483,47246,026,78926,835,0001,987,0002,482,176
7Apr 27, 2026 04:483,51046,619,70328,137,0001,004,0002,478,080
8Apr 27, 2026 04:483,55745,949,40428,508,0001,018,0002,330,624
9Apr 27, 2026 04:483,59247,470,71927,827,0001,987,0002,490,368