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 listAug 30, 2025 20:36Adam FolwarcznyAdam FolwarcznyScore: 10,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 20:3610,556122,563,38352,173,00035,438,0002,359,296
2Aug 30, 2025 20:3610,616118,414,73852,473,00035,642,0002,363,392
3Aug 30, 2025 20:3610,626114,417,07554,505,00033,694,0002,355,200
4Aug 30, 2025 20:3610,652115,980,01150,099,00038,311,0002,465,792
5Aug 30, 2025 20:3610,733118,676,69849,493,00039,594,0002,486,272
6Aug 30, 2025 20:3610,774113,924,67953,657,00035,771,0002,347,008
7Aug 30, 2025 20:3610,997120,272,19152,998,00038,276,0002,359,296
8Aug 30, 2025 20:3611,005117,317,56256,967,00034,377,0002,359,296
9Aug 30, 2025 20:3611,006123,462,05258,937,00032,415,0002,289,664
10Aug 30, 2025 20:3611,177114,830,91654,281,00038,490,0002,363,392
11Aug 30, 2025 20:3611,196120,671,31154,370,00038,553,0002,433,024
12Aug 30, 2025 20:3611,210121,886,21357,407,00035,632,0002,473,984