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 13, 2026 11:16wnwnScore: 4,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 11:164,10163,313,06632,034,0002,002,0002,277,376
2Apr 13, 2026 11:164,19766,579,72032,847,0001,990,0002,498,560
3Apr 13, 2026 11:164,22961,890,19133,093,0002,005,0002,482,176