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:07TudyMTudyMScore: 34,464Success
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:0834,444304,282,894282,893,0002,998,0002,527,232
2Apr 26, 2026 15:0834,464301,915,391284,052,0002,000,0002,519,040
3Apr 26, 2026 15:0834,486308,456,098284,241,0002,001,0002,527,232