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:12wnwnScore: 3,470Success
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:133,41845,256,20627,357,0001,013,0002,330,624
2Apr 26, 2026 16:133,42347,041,98827,400,0001,014,0002,486,272
3Apr 26, 2026 16:133,42446,979,78727,409,0001,015,0002,490,368
4Apr 26, 2026 16:133,44942,594,88727,607,0001,022,0002,326,528
5Apr 26, 2026 16:133,47044,868,75426,815,0001,986,0002,486,272
6Apr 26, 2026 16:133,61647,854,23228,017,0002,001,0002,494,464
7Apr 26, 2026 16:133,62844,088,77929,112,0001,003,0002,330,624
8Apr 26, 2026 16:133,63547,510,64829,166,0001,005,0002,490,368
9Apr 26, 2026 16:133,64443,878,64629,238,0001,008,0002,482,176