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 listJun 25, 2026 00:20Victor MerckléVictor MerckléScore: 4,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 00:214,17742,183,84733,579,0001,097,0002,113,536
2Jun 25, 2026 00:214,18642,381,54833,693,0001,057,0002,113,536
3Jun 25, 2026 00:214,18742,722,15933,636,0001,121,0002,113,536
4Jun 25, 2026 00:214,18742,398,00333,649,0001,104,0002,113,536
5Jun 25, 2026 00:214,19242,367,17133,699,0001,095,0002,113,536
6Jun 25, 2026 00:214,19542,388,16933,697,0001,122,0002,113,536
7Jun 25, 2026 00:214,20742,808,99033,799,0001,122,0002,113,536
8Jun 25, 2026 00:214,28343,437,71034,455,0001,099,0002,113,536
9Jun 25, 2026 00:214,54445,643,07636,689,0001,029,0002,113,536