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 listMar 20, 2026 02:00zielajzielajScore: 3,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:003,61353,323,21327,988,0001,999,0002,527,232
2Mar 20, 2026 02:013,61851,540,09028,030,0002,002,0002,514,944
3Mar 20, 2026 02:013,63552,631,79628,163,0002,011,0002,441,216
4Mar 20, 2026 02:013,65649,926,98429,330,0001,011,0002,514,944
5Mar 20, 2026 02:003,66055,584,48529,366,0001,012,0002,437,120
6Mar 20, 2026 02:003,67154,812,49229,454,0001,015,0002,514,944