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 24, 2026 14:19Victor MerckléVictor MerckléScore: 36,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 14:2635,907305,986,803296,953,0001,083,0002,117,632stderr
2May 24, 2026 14:2636,128307,926,816298,781,0001,088,0002,117,632stderr
3May 24, 2026 14:2636,173308,114,239299,170,0001,068,0002,117,632stderr
4May 24, 2026 14:2636,179309,249,553299,136,0001,155,0002,117,632stderr
5May 24, 2026 14:2636,268310,299,702300,029,0001,001,0002,117,632stderr
6May 24, 2026 14:2636,499312,473,074301,942,0001,007,0002,117,632stderr
7May 24, 2026 14:2636,660312,125,482303,281,0001,001,0002,117,632stderr
8May 24, 2026 14:2638,407338,084,379317,696,0001,085,0002,117,632stderr
9May 24, 2026 14:2638,456341,517,667318,142,0001,046,0002,117,632stderr