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 listApr 27, 2026 04:52wnwnScore: 3,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 04:523,45341,791,77627,644,0001,023,0002,482,176
2Apr 27, 2026 04:523,45544,807,09327,659,0001,024,0002,490,368
3Apr 27, 2026 04:523,48647,082,01226,941,0001,995,0002,486,272
4Apr 27, 2026 04:523,48746,618,13726,951,0001,996,0002,486,272
5Apr 27, 2026 04:523,49846,239,50827,033,0002,002,0002,486,272
6Apr 27, 2026 04:523,49945,095,57027,042,0002,003,0002,473,984
7Apr 27, 2026 04:523,49945,642,11427,043,0002,003,0002,482,176
8Apr 27, 2026 04:523,51247,582,09828,145,0001,005,0002,490,368
9Apr 27, 2026 04:523,57848,454,66028,674,0001,024,0002,486,272