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 18, 2026 10:55boop34boop34Score: 9,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 10:569,03985,163,86474,003,0001,021,0002,113,536
2Jul 18, 2026 10:569,04585,052,64474,055,0001,021,0002,113,536
3Jul 18, 2026 10:569,05384,913,78074,123,0001,021,0002,113,536
4Jul 18, 2026 10:569,06084,932,76674,185,0001,021,0002,113,536
5Jul 18, 2026 10:569,07084,888,41074,261,0001,022,0002,113,536
6Jul 18, 2026 10:569,27387,200,32775,951,0001,020,0002,113,536
7Jul 18, 2026 10:569,31286,957,82876,269,0001,022,0002,113,536
8Jul 18, 2026 10:569,32687,064,57276,388,0001,021,0002,113,536
9Jul 18, 2026 10:569,73190,473,20079,767,0001,008,0002,113,536