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 listMay 24, 2026 19:39Maya RebholzMaya RebholzScore: 8,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:408,40581,017,70463,289,0006,479,0002,117,632
2May 24, 2026 19:408,43682,767,91763,513,0006,510,0002,117,632
3May 24, 2026 19:408,49880,409,94863,971,0006,566,0002,117,632
4May 24, 2026 19:408,51480,074,43364,202,0006,470,0002,117,632
5May 24, 2026 19:408,54887,174,03064,364,0006,590,0002,117,632
6May 24, 2026 19:408,72186,654,29666,040,0006,346,0002,117,632
7May 24, 2026 19:408,76987,501,56465,941,0006,842,0002,117,632
8May 24, 2026 19:408,81188,484,51466,339,0006,799,0002,117,632
9May 24, 2026 19:408,94188,921,09567,227,0006,986,0002,117,632