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:35Andrew EpsteinAndrew EpsteinScore: 152,243Success
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:35151,9211,271,163,3721,259,947,0001,002,0002,117,632stderr
2Sep 17, 2026 00:35152,0531,272,338,3101,261,042,0001,004,0002,117,632stderr
3Sep 17, 2026 00:35152,0801,272,499,8361,261,265,0001,003,0002,117,632stderr
4Sep 17, 2026 00:35152,1151,272,942,8211,261,552,0001,007,0002,117,632stderr
5Sep 17, 2026 00:35152,2431,273,852,3811,262,615,0001,005,0002,117,632stderr
6Sep 17, 2026 00:35152,3471,274,738,3121,263,477,0001,005,0002,117,632stderr
7Sep 17, 2026 00:35152,5021,276,012,2071,264,768,0001,004,0002,117,632stderr
8Sep 17, 2026 00:35152,5551,276,434,9511,265,192,0001,015,0002,117,632stderr
9Sep 17, 2026 00:35152,6201,278,170,6341,265,741,0001,008,0002,117,632stderr