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 listJan 21, 2025 23:13Gerard SmitGerard SmitScore: 71,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 23:1371,279619,216,248589,617,0001,998,0002,297,856
2Jan 21, 2025 23:1371,311616,693,216589,879,0001,999,0002,310,144
3Jan 21, 2025 23:1371,324615,218,949589,994,0001,999,0002,297,856
4Jan 21, 2025 23:1371,325619,571,671588,998,0002,999,0002,371,584
5Jan 21, 2025 23:1371,346623,472,862589,176,0002,995,0002,367,488
6Jan 21, 2025 23:1371,348613,955,020589,191,0003,000,0002,375,680
7Jan 21, 2025 23:1371,371618,875,575590,378,0002,001,0002,314,240
8Jan 21, 2025 23:1371,375617,515,368592,414,00002,310,144
9Jan 21, 2025 23:1371,394616,627,874589,573,0002,997,0002,383,872