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 listMay 16, 2026 03:33Victor 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
1May 16, 2026 03:33065,558,00257,699,00002,113,536expected "53691435078469396 ", got "53691432774469396 "
2May 16, 2026 03:336,95165,881,34656,680,0001,014,0002,113,536
3May 16, 2026 03:336,95266,571,56356,704,0001,001,0002,113,536
4May 16, 2026 03:336,96566,260,90356,799,0001,018,0002,113,536
5May 16, 2026 03:336,98367,255,38856,931,0001,028,0002,113,536
6May 16, 2026 03:337,01368,031,21557,171,0001,045,0002,113,536
7May 16, 2026 03:337,02868,651,12457,301,0001,032,0002,113,536
8May 16, 2026 03:337,08367,718,65657,784,0001,009,0002,113,536
9May 16, 2026 03:337,11868,542,20358,076,0001,004,0002,113,536