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 listMay 23, 2026 21:14Maya RebholzMaya RebholzScore: 8,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 21:148,56580,983,08564,114,0006,982,0002,121,728
2May 23, 2026 21:148,59982,442,68464,537,0006,839,0002,117,632
3May 23, 2026 21:148,61183,568,23864,443,0007,035,0002,117,632
4May 23, 2026 21:148,61184,115,88864,373,0007,105,0002,117,632
5May 23, 2026 21:148,66083,061,11264,847,0007,037,0002,117,632
6May 23, 2026 21:148,67884,672,72264,882,0007,149,0002,117,632
7May 23, 2026 21:148,68083,864,10164,931,0007,113,0002,117,632
8May 23, 2026 21:148,68385,290,94864,931,0007,143,0002,117,632
9May 23, 2026 21:148,73584,911,01665,309,0007,195,0002,121,728