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 listAug 11, 2026 11:16RabenknechtRabenknechtScore: 64,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:1663,721538,861,561527,857,0001,032,0002,113,536
2Aug 11, 2026 11:1663,782539,365,733528,323,0001,068,0002,113,536
3Aug 11, 2026 11:1663,846540,098,889528,878,0001,052,0002,113,536
4Aug 11, 2026 11:1663,879540,660,732529,092,0001,111,0002,113,536
5Aug 11, 2026 11:1664,005541,364,825530,140,0001,109,0002,113,536
6Aug 11, 2026 11:1664,039541,815,675530,526,0001,003,0002,113,536
7Aug 11, 2026 11:1664,114542,215,669531,113,0001,036,0002,113,536
8Aug 11, 2026 11:1664,151542,407,095531,433,0001,024,0002,113,536
9Aug 11, 2026 11:1664,224543,116,972532,031,0001,029,0002,113,536