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 listJul 12, 2026 13:19Kevin HeaveyKevin HeaveyScore: 3,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 13:213,95542,430,21331,620,0001,210,0002,117,632
2Jul 12, 2026 13:213,95642,535,35131,798,0001,043,0002,117,632
3Jul 12, 2026 13:213,95842,562,47431,820,0001,039,0002,117,632
4Jul 12, 2026 13:213,96642,531,41231,881,0001,041,0002,117,632
5Jul 12, 2026 13:213,96843,985,38731,899,0001,042,0002,117,632
6Jul 12, 2026 13:213,97042,908,64031,918,0001,040,0002,117,632
7Jul 12, 2026 13:213,97742,652,52531,968,0001,049,0002,117,632
8Jul 12, 2026 13:213,98042,628,12932,002,0001,039,0002,117,632
9Jul 12, 2026 13:214,03343,153,81732,437,0001,039,0002,117,632