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 19, 2026 01:52wnwnScore: 51,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:5251,494456,631,472426,398,0001,000,0002,265,088
2Apr 19, 2026 01:5251,534452,092,760425,731,0001,998,0002,289,664
3Apr 19, 2026 01:5251,815452,327,476428,066,0002,000,0002,269,184