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 23, 2026 00:05M-RochatM-RochatScore: 6,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 00:066,52963,362,54753,177,0001,016,0002,113,536
2May 23, 2026 00:066,53565,742,61453,227,0001,015,0002,113,536
3May 23, 2026 00:066,55363,822,70053,377,0001,016,0002,113,536
4May 23, 2026 00:066,61566,513,39753,890,0001,017,0002,113,536
5May 23, 2026 00:066,61765,165,09353,907,0001,018,0002,113,536
6May 23, 2026 00:066,62567,042,16853,978,0001,017,0002,113,536
7May 23, 2026 00:066,62865,844,33253,991,0001,023,0002,113,536
8May 23, 2026 00:066,62966,407,38853,998,0001,030,0002,113,536
9May 23, 2026 00:066,64864,507,31454,165,0001,017,0002,113,536