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 listMar 12, 2026 13:24Sergey SerebryakovSergey SerebryakovScore: 11,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 13:2411,082118,882,65589,982,0001,999,0002,277,376
2Mar 12, 2026 13:2411,127112,000,24191,352,0001,003,0002,437,120
3Mar 12, 2026 13:2411,224119,662,44090,152,0003,005,0002,277,376
4Mar 12, 2026 13:2411,486114,764,61694,328,0001,003,0002,441,216
5Mar 12, 2026 13:2411,505122,209,87294,483,0001,005,0002,277,376
6Mar 12, 2026 13:2411,553121,170,68793,896,0001,997,0002,277,376