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 listFeb 26, 2026 09:35lipapipalipapipaScore: 5,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 09:355,85275,601,75446,546,0002,023,0002,347,008
2Feb 26, 2026 09:355,88576,255,71146,849,0001,993,0002,363,392
3Feb 26, 2026 09:355,90477,702,98245,004,0004,000,0002,383,872
4Feb 26, 2026 09:355,92578,588,11046,167,0003,010,0002,506,752
5Feb 26, 2026 09:356,01370,468,73046,915,0002,994,0002,453,504
6Feb 26, 2026 09:356,20774,009,66448,484,0003,030,0002,265,088