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 23, 2026 07:14Kevin HeaveyKevin HeaveyScore: 3,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:173,31936,430,14726,436,0001,117,0002,113,536
2Sep 23, 2026 07:173,32336,383,61626,433,0001,148,0002,113,536
3Sep 23, 2026 07:173,32836,407,66426,466,0001,162,0002,113,536
4Sep 23, 2026 07:173,33036,547,39626,478,0001,162,0002,113,536
5Sep 23, 2026 07:173,33436,472,64626,514,0001,159,0002,113,536
6Sep 23, 2026 07:173,34136,527,61426,594,0001,141,0002,113,536
7Sep 23, 2026 07:173,34137,230,05426,722,0001,010,0002,113,536
8Sep 23, 2026 07:173,35137,355,19826,808,0001,011,0002,113,536
9Sep 23, 2026 07:173,35936,673,85126,867,0001,018,0002,113,536