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 listMay 10, 2026 10:59wnwnScore: 3,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:003,38743,166,71927,032,0001,085,0002,486,272
2May 10, 2026 11:003,39045,864,41927,074,0001,068,0002,478,080
3May 10, 2026 11:003,39247,012,11227,086,0001,068,0002,498,560
4May 10, 2026 11:003,39745,513,22427,112,0001,087,0002,482,176
5May 10, 2026 11:003,39842,244,02327,149,0001,062,0002,490,368
6May 10, 2026 11:003,42946,841,54727,340,0001,123,0002,482,176
7May 10, 2026 11:003,44146,529,91227,449,0001,114,0002,486,272
8May 10, 2026 11:003,51842,488,66028,119,0001,084,0002,486,272
9May 10, 2026 11:003,59544,779,02628,766,0001,076,0002,490,368