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 2, 2026 11:30Priyansh RathiPriyansh RathiScore: 45,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 11:3044,916399,480,958370,803,0001,998,0002,351,104
2Mar 2, 2026 11:3044,939403,464,906367,994,0004,999,0002,359,296
3Mar 2, 2026 11:3045,318405,877,747374,142,0002,000,0002,359,296
4Mar 2, 2026 11:3045,341409,606,798375,333,0001,000,0002,396,160
5Mar 2, 2026 11:3045,378405,239,500373,637,0002,997,0002,371,584
6Mar 2, 2026 11:3045,394408,919,475374,772,0001,998,0002,355,200
7Mar 2, 2026 11:3045,402410,138,513373,837,0002,998,0002,547,712
8Mar 2, 2026 11:3045,476406,411,248376,452,0001,001,0002,543,616
9Mar 2, 2026 11:3045,539407,476,114376,975,000999,0002,359,296