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 26, 2026 16:10wnwnScore: 3,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:103,39749,436,83527,189,0001,007,0002,482,176
2Apr 26, 2026 16:103,41743,150,45427,356,0001,013,0002,322,432
3Apr 26, 2026 16:103,43049,598,63727,456,0001,016,0002,490,368
4Apr 26, 2026 16:103,45949,430,04327,685,0001,025,0002,478,080
5Apr 26, 2026 16:103,46248,295,35126,755,0001,981,0002,482,176
6Apr 26, 2026 16:103,46646,024,94726,792,0001,984,0002,478,080
7Apr 26, 2026 16:103,47147,306,85226,829,0001,987,0002,490,368
8Apr 26, 2026 16:103,59149,589,02128,784,0001,028,0002,490,368
9Apr 26, 2026 16:103,63344,377,64529,155,0001,005,0002,490,368