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 listMar 8, 2026 06:18caandocaandoScore: 8,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 06:187,52383,383,76761,434,0001,007,0002,383,872
2Mar 8, 2026 06:187,52491,837,54261,442,0001,007,0002,285,568
3Mar 8, 2026 06:187,54089,631,73861,571,0001,009,0002,285,568
4Mar 8, 2026 06:188,447100,068,40570,109,00002,285,568
5Mar 8, 2026 06:188,45396,885,29368,153,0002,004,0002,285,568
6Mar 8, 2026 06:188,47391,664,04868,316,0002,009,0002,269,184