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 00:43Andrew EpsteinAndrew EpsteinScore: 158,052Success
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 00:44157,6561,318,815,2871,307,544,0001,001,0002,117,632stderr
2Sep 17, 2026 00:44157,7751,319,701,6781,308,532,0001,001,0002,117,632stderr
3Sep 17, 2026 00:44157,9591,321,270,3141,310,056,0001,004,0002,117,632stderr
4Sep 17, 2026 00:44158,0391,322,063,6131,310,730,0001,001,0002,117,632stderr
5Sep 17, 2026 00:44158,0521,322,317,1871,310,834,0001,000,0002,117,632stderr
6Sep 17, 2026 00:44158,0741,322,368,3981,311,017,0001,003,0002,117,632stderr
7Sep 17, 2026 00:44158,1231,323,312,6071,311,424,0001,000,0002,117,632stderr
8Sep 17, 2026 00:44158,2261,323,538,4061,312,274,0001,002,0002,117,632stderr
9Sep 17, 2026 00:44158,2681,323,962,3271,312,609,0001,020,0002,117,632stderr