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 17, 2026 14:50Victor MerckléVictor MerckléScore: 7,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:517,34269,744,39459,912,0001,031,0002,113,536
2May 17, 2026 14:517,34371,045,55659,893,0001,057,0002,113,536
3May 17, 2026 14:517,34470,735,50359,918,0001,039,0002,113,536
4May 17, 2026 14:517,34570,431,19159,915,0001,053,0002,113,536
5May 17, 2026 14:517,34670,838,00159,894,0001,079,0002,113,536
6May 17, 2026 14:517,34770,849,13859,962,0001,022,0002,113,536
7May 17, 2026 14:517,34770,799,11359,935,0001,053,0002,113,536
8May 17, 2026 14:517,34869,490,49259,958,0001,034,0002,113,536
9May 17, 2026 14:517,35971,115,30860,041,0001,040,0002,113,536