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 listJan 22, 2026 09:47lipapipalipapipaScore: 40,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 09:4740,858362,145,454339,118,00002,273,280
2Jan 22, 2026 09:4740,871358,474,986338,227,0001,000,0002,273,280
3Jan 22, 2026 09:4740,886360,448,307338,356,0001,001,0002,273,280
4Jan 22, 2026 09:4740,911366,979,920338,566,000998,0002,269,184
5Jan 22, 2026 09:4740,968363,410,357338,031,0002,000,0002,400,256
6Jan 22, 2026 09:4740,973369,937,596338,080,0002,000,0002,269,184
7Jan 22, 2026 09:4740,984366,914,934340,168,00002,404,352
8Jan 22, 2026 09:4740,996364,220,895340,264,00002,269,184
9Jan 22, 2026 09:4741,007366,123,003337,367,0002,994,0002,400,256