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 17, 2026 15:02wnwnScore: 7,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 15:027,57386,465,99760,860,0001,995,0002,494,464
2Apr 17, 2026 15:027,57483,873,68960,866,0001,995,0002,277,376
3Apr 17, 2026 15:027,58088,215,90660,913,0001,997,0002,486,272