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 19, 2026 01:29Ondřej PolaneckýOndřej PolaneckýScore: 179,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 01:30178,6211,492,283,9491,481,555,0001,006,0002,117,632stderr
2Jul 19, 2026 01:30178,7431,493,257,4681,482,566,0001,004,0002,117,632stderr
3Jul 19, 2026 01:30178,7951,493,699,9581,482,980,0001,020,0002,117,632stderr
4Jul 19, 2026 01:30179,0491,495,836,1081,485,112,0001,002,0002,117,632stderr
5Jul 19, 2026 01:30179,1601,498,045,1101,486,032,0001,000,0002,117,632stderr
6Jul 19, 2026 01:30179,1921,497,069,4581,486,109,0001,192,0002,117,632stderr
7Jul 19, 2026 01:30179,7981,502,269,6131,490,283,0002,043,0002,117,632stderr
8Jul 19, 2026 01:30179,8431,502,528,1961,490,669,0002,029,0002,117,632stderr
9Jul 19, 2026 01:30179,8951,502,837,6381,492,128,0001,005,0002,117,632stderr