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 listAug 14, 2026 17:11marko1597marko1597Score: 183,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:12182,5431,525,879,2721,513,868,0001,240,0002,117,632stderr
2Aug 14, 2026 17:12182,5901,525,782,2101,514,497,0001,000,0002,117,632stderr
3Aug 14, 2026 17:12182,8581,527,781,0351,516,464,0001,265,0002,117,632stderr
4Aug 14, 2026 17:12182,9331,528,427,7541,517,340,0001,004,0002,117,632stderr
5Aug 14, 2026 17:12183,5761,534,062,0511,522,681,0001,001,0002,117,632stderr
6Aug 14, 2026 17:12183,6851,534,753,5291,523,592,0001,001,0002,117,632stderr
7Aug 14, 2026 17:12183,8111,535,660,0611,524,369,0001,269,0002,117,632stderr
8Aug 14, 2026 17:12183,8711,536,391,9021,525,135,0001,002,0002,117,632stderr
9Aug 14, 2026 17:12184,4171,540,785,6721,529,472,0001,194,0002,117,632stderr