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 09:58Victor MerckléVictor MerckléScore: 16,284Success
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 09:5916,274143,497,228134,039,0001,040,0002,113,536
2Aug 27, 2026 09:5916,280143,553,162134,083,0001,049,0002,113,536
3Aug 27, 2026 09:5916,281143,517,854134,092,0001,045,0002,113,536
4Aug 27, 2026 09:5916,282143,549,744134,089,0001,054,0002,113,536
5Aug 27, 2026 09:5916,284143,614,355134,113,0001,048,0002,113,536
6Aug 27, 2026 09:5916,284143,604,905134,071,0001,094,0002,113,536
7Aug 27, 2026 09:5916,285143,529,661134,125,0001,045,0002,113,536
8Aug 27, 2026 09:5916,287143,537,535134,145,0001,043,0002,113,536
9Aug 27, 2026 09:5916,287143,534,245134,130,0001,058,0002,113,536