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 listJan 7, 2026 09:26Pavel SkripkinPavel SkripkinScore: 103,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 09:26103,373889,679,628621,271,000236,722,0002,363,392
2Jan 7, 2026 09:26103,879891,966,927623,416,000238,776,0002,314,240
3Jan 7, 2026 09:26104,087895,219,832624,221,000239,701,0002,289,664