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:45Priyansh RathiPriyansh RathiScore: 43,654Success
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:4543,328389,578,026356,625,0002,996,0002,371,584
2Mar 2, 2026 11:4543,608391,419,459359,947,0001,999,0002,531,328
3Mar 2, 2026 11:4543,623389,678,903361,073,0001,000,0002,355,200
4Mar 2, 2026 11:4543,652387,651,427360,312,0002,001,0002,359,296
5Mar 2, 2026 11:4543,654387,973,039361,328,0001,000,0002,371,584
6Mar 2, 2026 11:4543,695387,247,138361,670,000999,0002,359,296
7Mar 2, 2026 11:4543,713387,908,896360,822,0001,999,0002,535,424
8Mar 2, 2026 11:4543,742394,339,034362,060,0001,000,0002,531,328
9Mar 2, 2026 11:4543,781394,461,395361,378,0002,002,0002,535,424