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 13, 2026 17:02Aleksei ShahoikaAleksei ShahoikaScore: 15,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:0314,936132,656,005101,405,00022,564,0002,113,536
2May 13, 2026 17:0314,974133,229,200101,254,00023,031,0002,113,536
3May 13, 2026 17:0314,989133,169,080102,232,00022,182,0002,113,536
4May 13, 2026 17:0315,010133,869,504101,151,00023,434,0002,113,536
5May 13, 2026 17:0315,061133,996,037102,639,00022,369,0002,113,536
6May 13, 2026 17:0315,074142,977,515101,527,00023,590,0002,113,536
7May 13, 2026 17:0315,134134,285,085102,667,00022,952,0002,113,536
8May 13, 2026 17:0315,179134,712,999102,734,00023,259,0002,113,536
9May 13, 2026 17:0315,443139,057,079102,741,00025,436,0002,113,536