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 22, 2026 18:56Kasper KivimäkiKasper KivimäkiScore: 59,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:5657,975491,084,823480,196,0001,001,0002,113,536
2Jul 22, 2026 18:5657,997491,890,136480,133,0001,250,0002,113,536
3Jul 22, 2026 18:5658,588496,156,050485,279,0001,002,0002,113,536
4Jul 22, 2026 18:5659,073500,863,866489,298,0001,012,0002,113,536
5Jul 22, 2026 18:5659,077501,404,357489,173,0001,171,0002,113,536
6Jul 22, 2026 18:5659,077500,276,386489,179,0001,161,0002,113,536
7Jul 22, 2026 18:5659,128500,607,858489,607,0001,162,0002,113,536
8Jul 22, 2026 18:5659,129501,076,454489,511,0001,265,0002,113,536
9Jul 22, 2026 18:5659,192501,176,393490,054,0001,245,0002,113,536