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 12, 2026 12:25wnwnScore: 4,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 12:254,63168,317,78737,424,0001,011,0002,277,376
2Apr 12, 2026 12:254,65764,608,93237,637,0001,017,0002,498,560
3Apr 12, 2026 12:254,74463,894,72438,365,0001,009,0002,277,376