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 listSep 17, 2026 02:48Andrew EpsteinAndrew EpsteinScore: 85,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:4885,332718,538,850707,258,0001,001,0002,117,632stderr
2Sep 17, 2026 02:4885,463720,191,466708,333,0001,010,0002,117,632stderr
3Sep 17, 2026 02:4885,628720,961,616709,712,0001,006,0002,117,632stderr
4Sep 17, 2026 02:4885,683721,974,685710,171,0001,005,0002,117,632stderr
5Sep 17, 2026 02:4885,803722,404,968711,171,0001,002,0002,117,632stderr
6Sep 17, 2026 02:4886,140725,268,540713,956,0001,006,0002,117,632stderr
7Sep 17, 2026 02:4886,181725,485,142714,301,0001,008,0002,117,632stderr
8Sep 17, 2026 02:4886,430727,537,880716,350,0001,019,0002,117,632stderr
9Sep 17, 2026 02:4886,494728,221,082716,905,0001,003,0002,117,632stderr