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 15:26wnwnScore: 3,980Success
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 15:263,43344,325,78627,482,0001,017,0002,490,368
2Apr 26, 2026 15:263,44944,439,47527,612,0001,022,0002,486,272
3Apr 26, 2026 15:263,66750,043,39629,426,0001,014,0002,330,624
4Apr 26, 2026 15:263,88647,508,51431,251,0001,008,0002,490,368
5Apr 26, 2026 15:263,98050,037,00831,038,0002,002,0002,334,720
6Apr 26, 2026 15:264,31958,088,69934,829,0001,024,0002,494,464
7Apr 26, 2026 15:264,33956,871,90434,014,0002,000,0002,494,464
8Apr 26, 2026 15:264,46551,667,21435,061,0002,003,0002,486,272
9Apr 26, 2026 15:265,28362,371,04442,858,000996,0002,334,720