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 listFeb 9, 2026 21:02Daniel MastalerzDaniel MastalerzScore: 10,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 21:029,905103,214,43979,206,0003,007,0002,387,968
2Feb 9, 2026 21:029,925105,677,54676,348,0006,027,0002,510,848
3Feb 9, 2026 21:029,960114,094,80481,662,0001,008,0002,314,240
4Feb 9, 2026 21:0210,106109,686,25579,885,0003,994,0002,519,040
5Feb 9, 2026 21:0210,125106,324,13380,036,0004,001,0002,265,088
6Feb 9, 2026 21:0210,127107,756,65681,050,0003,001,0002,519,040