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 6, 2026 07:11Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:11039,827,53429,300,0001,078,0002,117,632expected "53684520257575371 ", got "170336775276583129"
2Jul 6, 2026 07:11040,272,25429,708,0001,094,0002,117,632expected "53692346083212862 ", got "170442925291567128"
3Jul 6, 2026 07:11040,001,23229,439,0001,094,0002,117,632expected "53685051513232520 ", got "170290861119541002"