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 18, 2026 03:47wnwnScore: 8,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 03:526,62279,868,72753,963,000999,0002,293,760
2Apr 18, 2026 03:526,62281,107,49653,963,000999,0002,293,760
3Apr 18, 2026 03:526,85679,859,11054,905,0001,996,0002,293,760
4Apr 18, 2026 03:478,02494,261,74665,587,0001,009,0002,269,184
5Apr 18, 2026 03:478,14099,804,36366,557,0001,008,0002,293,760
6Apr 18, 2026 03:478,14394,470,59766,580,0001,008,0002,281,472