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 listJul 21, 2026 16:26Kevin HeaveyKevin HeaveyScore: 3,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 16:293,64740,099,66829,214,0001,058,0002,113,536
2Jul 21, 2026 16:293,67540,418,03429,445,0001,062,0002,113,536
3Jul 21, 2026 16:293,69340,499,05829,603,0001,050,0002,113,536
4Jul 21, 2026 16:293,70040,549,06629,661,0001,051,0002,113,536
5Jul 21, 2026 16:293,75441,091,74930,110,0001,052,0002,113,536
6Jul 21, 2026 16:293,78141,195,46330,326,0001,057,0002,113,536
7Jul 21, 2026 16:293,78541,274,52130,360,0001,061,0002,113,536
8Jul 21, 2026 16:293,82141,755,35730,664,0001,056,0002,113,536
9Jul 21, 2026 16:293,90444,852,98731,354,0001,053,0002,113,536