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 26, 2026 15:35wnwnScore: 3,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:353,39543,367,94027,174,0001,006,0002,482,176
2Apr 26, 2026 15:353,39842,175,71027,198,0001,007,0002,490,368
3Apr 26, 2026 15:353,41545,010,25727,336,0001,012,0002,490,368
4Apr 26, 2026 15:353,44250,007,59828,570,00002,482,176
5Apr 26, 2026 15:353,45943,855,64526,733,0001,980,0002,330,624
6Apr 26, 2026 15:353,51546,996,97928,171,0001,006,0002,482,176
7Apr 26, 2026 15:353,59041,527,68827,817,0001,986,0002,465,792
8Apr 26, 2026 15:353,60646,402,14227,940,0001,995,0002,482,176
9Apr 26, 2026 15:353,65949,066,47729,360,0001,012,0002,482,176