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 listSep 7, 2026 15:05Kevin PetersKevin PetersScore: 67,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:0667,176567,694,630500,512,00057,049,0002,113,536
2Sep 7, 2026 15:0667,184567,968,663500,318,00057,317,0002,113,536
3Sep 7, 2026 15:0667,229568,255,245499,565,00058,439,0002,113,536
4Sep 7, 2026 15:0667,236568,979,144499,907,00058,154,0002,113,536
5Sep 7, 2026 15:0667,239568,355,941499,885,00058,204,0002,113,536
6Sep 7, 2026 15:0667,291568,636,911499,776,00058,743,0002,113,536
7Sep 7, 2026 15:0667,340569,070,888500,793,00058,135,0002,113,536
8Sep 7, 2026 15:0667,438569,941,076500,615,00059,127,0002,113,536
9Sep 7, 2026 15:0667,509570,349,352500,673,00059,656,0002,113,536