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 27, 2026 00:17Code HintsCode HintsScore: 8,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 00:178,51478,410,84967,481,0003,191,0002,113,536
2Jun 27, 2026 00:178,51878,160,23467,670,0003,033,0002,113,536
3Jun 27, 2026 00:178,53078,539,07967,689,0003,113,0002,113,536
4Jun 27, 2026 00:178,54178,608,15167,807,0003,089,0002,113,536
5Jun 27, 2026 00:178,54778,474,68367,848,0003,100,0002,113,536
6Jun 27, 2026 00:178,57778,687,81168,096,0003,098,0002,113,536
7Jun 27, 2026 00:178,66379,433,91668,829,0003,077,0002,113,536
8Jun 27, 2026 00:178,74680,145,74769,536,0003,061,0002,113,536
9Jun 27, 2026 00:179,06284,199,05571,810,0003,408,0002,113,536