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 15, 2026 06:37Victor 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 15, 2026 06:37067,111,79957,050,0001,021,0002,113,536expected "53693758394609345 ", got "53693712314609345 "
2May 15, 2026 06:376,98666,100,42757,991,00002,113,536
3May 15, 2026 06:376,98867,152,96956,994,0001,012,0002,113,536
4May 15, 2026 06:376,99066,207,09958,020,00002,113,536
5May 15, 2026 06:376,99368,443,91157,047,0001,001,0002,113,536
6May 15, 2026 06:376,99367,495,64157,041,0001,007,0002,113,536
7May 15, 2026 06:376,99465,454,39658,055,00002,113,536
8May 15, 2026 06:376,99571,678,47557,022,0001,043,0002,113,536
9May 15, 2026 06:377,00067,970,44757,091,0001,010,0002,113,536