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 listAug 27, 2026 00:34Victor MerckléVictor MerckléScore: 4,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 00:354,79848,916,13038,546,0001,280,0002,535,424stderr
2Aug 27, 2026 00:354,85648,665,06039,111,0001,198,0002,535,424stderr
3Aug 27, 2026 00:354,85749,412,86939,027,0001,293,0002,535,424stderr
4Aug 27, 2026 00:354,87148,807,84539,141,0001,291,0002,535,424stderr
5Aug 27, 2026 00:354,87248,774,05339,231,0001,209,0002,535,424stderr
6Aug 27, 2026 00:354,91759,553,53639,788,0001,028,0002,539,520stderr
7Aug 27, 2026 00:355,01850,214,82740,447,0001,203,0002,535,424stderr
8Aug 27, 2026 00:355,07260,314,75840,827,0001,271,0002,535,424stderr
9Aug 27, 2026 00:355,36461,424,97443,499,0001,029,0002,535,424stderr