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 2, 2026 04:24Victor MerckléVictor MerckléScore: 4,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 04:254,13942,117,42333,257,0001,102,0002,117,632stderr
2Jul 2, 2026 04:254,14442,256,87533,290,0001,109,0002,117,632stderr
3Jul 2, 2026 04:254,14642,141,25233,315,0001,099,0002,117,632stderr
4Jul 2, 2026 04:254,14842,278,57733,312,0001,120,0002,117,632stderr
5Jul 2, 2026 04:254,15642,223,72533,484,0001,018,0002,117,632stderr
6Jul 2, 2026 04:254,16242,399,51333,449,0001,101,0002,117,632stderr
7Jul 2, 2026 04:254,16942,456,77433,583,0001,022,0002,117,632stderr
8Jul 2, 2026 04:254,18642,575,76733,689,0001,055,0002,117,632stderr
9Jul 2, 2026 04:254,20842,670,88833,898,0001,033,0002,117,632stderr