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 listApr 28, 2026 15:56Charles CabergsCharles CabergsScore: 12,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 15:5712,583119,420,584103,440,0001,004,0002,367,488
2Apr 28, 2026 15:5712,584127,430,472103,445,0001,004,0002,359,296
3Apr 28, 2026 15:5712,586120,128,925103,465,0001,004,0002,375,680
4Apr 28, 2026 15:5712,597121,634,908104,558,00002,367,488
5Apr 28, 2026 15:5712,599122,587,375103,572,0001,005,0002,383,872
6Apr 28, 2026 15:5712,745123,801,065103,794,0001,996,0002,367,488
7Apr 28, 2026 15:5712,761120,237,299103,919,0001,998,0002,293,760
8Apr 28, 2026 15:5712,763121,922,287103,937,0001,998,0002,383,872
9Apr 28, 2026 15:5712,769124,298,994103,989,0001,999,0002,306,048