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 listMar 4, 2026 15:24juniskewljuniskewlScore: 63,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:2463,665555,715,767527,423,0001,000,0002,523,136
2Mar 4, 2026 15:2463,685550,303,446527,583,000999,0002,379,776
3Mar 4, 2026 15:2463,700562,975,141526,709,0001,998,0002,265,088
4Mar 4, 2026 15:2463,700554,851,408526,711,0001,998,0002,265,088
5Mar 4, 2026 15:2463,702552,730,223526,726,0001,998,0002,260,992
6Mar 4, 2026 15:2463,711555,543,793527,800,000999,0002,375,680
7Mar 4, 2026 15:2463,713556,441,772526,822,0001,999,0002,265,088
8Mar 4, 2026 15:2463,719554,194,302528,865,00002,265,088
9Mar 4, 2026 15:2463,874552,610,322526,153,0004,001,0002,383,872