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 listSep 2, 2026 03:31Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 03:32036,443,38526,981,0001,074,0002,113,536expected "53689862464721799 ", got "0 "
2Sep 2, 2026 03:32036,926,81226,887,0001,072,0002,113,536expected "53683121476662285 ", got "0 "
3Sep 2, 2026 03:32036,539,77027,131,0001,028,0002,113,536expected "53687038582814253 ", got "0 "