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 12, 2026 04:46Josu San MartinJosu San MartinScore: 4,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 04:474,67049,527,54837,647,0001,122,0002,113,536
2May 12, 2026 04:474,67750,447,23537,684,0001,143,0002,113,536
3May 12, 2026 04:474,68247,557,76937,746,0001,121,0002,113,536
4May 12, 2026 04:474,68347,539,12937,754,0001,119,0002,113,536
5May 12, 2026 04:474,68350,083,71637,744,0001,133,0002,113,536
6May 12, 2026 04:474,68449,920,70037,747,0001,134,0002,113,536
7May 12, 2026 04:474,68549,311,15337,872,0001,019,0002,113,536
8May 12, 2026 04:474,68947,616,53237,743,0001,176,0002,113,536
9May 12, 2026 04:474,70847,789,25938,077,0001,006,0002,113,536