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 listOct 16, 2026 19:01KacpxerKacpxerScore: 5,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 19:015,67457,606,21146,089,0001,010,0002,113,536
2Oct 16, 2026 19:015,76158,264,37246,630,0001,190,0002,113,536
3Oct 16, 2026 19:015,77058,416,16646,697,0001,202,0002,113,536
4Oct 16, 2026 19:015,77258,421,36146,645,0001,265,0002,113,536
5Oct 16, 2026 19:015,79058,581,77046,858,0001,202,0002,113,536
6Oct 16, 2026 19:015,96559,971,64748,335,0001,179,0002,113,536
7Oct 16, 2026 19:015,98460,120,88348,480,0001,188,0002,113,536
8Oct 16, 2026 19:016,24062,341,81150,604,0001,195,0002,113,536
9Oct 16, 2026 19:016,59365,238,11453,713,0001,010,0002,113,536