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 23, 2026 17:14Victor MerckléVictor MerckléScore: 81,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:1681,523685,049,237671,079,0005,569,0002,117,632stderr
2Aug 23, 2026 17:1681,595685,608,043671,846,0005,396,0002,117,632stderr
3Aug 23, 2026 17:1681,704687,131,691672,671,0005,479,0002,117,632stderr
4Aug 23, 2026 17:1681,746686,923,337673,211,0005,289,0002,117,632stderr
5Aug 23, 2026 17:1681,844687,767,333673,713,0005,594,0002,117,632stderr
6Aug 23, 2026 17:1682,128690,624,871676,080,0005,586,0002,117,632stderr
7Aug 23, 2026 17:1682,398693,025,391678,109,0005,796,0002,117,632stderr
8Aug 23, 2026 17:1682,476693,684,258678,894,0005,659,0002,117,632stderr
9Aug 23, 2026 17:1682,872696,355,218681,910,0005,932,0002,117,632stderr