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 listSep 12, 2024 14:37Dmitrii KravchenkoDmitrii KravchenkoScore: 43,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 14:3743,369383,669,562358,965,000999,0002,363,392
2Sep 12, 2024 14:3743,591383,327,704360,807,000999,0002,355,200
3Sep 12, 2024 14:3743,616391,848,681361,012,0001,000,0002,351,104
4Sep 12, 2024 14:3743,620385,077,092360,048,0002,000,0002,457,600
5Sep 12, 2024 14:3743,628390,770,066360,115,0002,000,0002,281,472
6Sep 12, 2024 14:3743,629382,831,854360,122,0002,000,0002,277,376
7Sep 12, 2024 14:3743,633383,486,160360,158,0002,000,0002,281,472
8Sep 12, 2024 14:3743,644387,648,154361,248,0001,000,0002,281,472
9Sep 12, 2024 14:3743,666391,874,961361,427,0001,001,0002,281,472