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 4, 2026 11:22limanjun99limanjun99Score: 4,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 11:224,46152,466,61434,779,0002,255,0002,498,560
2May 4, 2026 11:224,49055,938,46133,925,0003,345,0002,490,368
3May 4, 2026 11:224,49855,527,74135,078,0002,260,0002,502,656
4May 4, 2026 11:224,51455,975,51235,188,0002,280,0002,494,464
5May 4, 2026 11:224,51656,252,27634,378,0003,107,0002,502,656
6May 4, 2026 11:224,53956,011,41234,386,0003,288,0002,502,656
7May 4, 2026 11:224,54953,947,50135,467,0002,290,0002,502,656
8May 4, 2026 11:224,55957,059,87835,570,0002,273,0002,478,080
9May 4, 2026 11:224,61655,510,51835,043,0003,276,0002,494,464