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 28, 2026 15:14Victor MerckléVictor MerckléScore: 9,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:159,32885,791,84576,415,0001,013,0002,117,632stderr
2Aug 28, 2026 15:159,35786,064,52976,564,0001,103,0002,117,632stderr
3Aug 28, 2026 15:159,42086,363,50877,181,0001,008,0002,117,632stderr
4Aug 28, 2026 15:159,54787,628,04078,228,0001,015,0002,117,632stderr
5Aug 28, 2026 15:159,56987,800,41778,405,0001,018,0002,117,632stderr
6Aug 28, 2026 15:159,59488,024,86078,619,0001,013,0002,117,632stderr
7Aug 28, 2026 15:159,60988,108,56278,673,0001,083,0002,117,632stderr
8Aug 28, 2026 15:159,60988,087,34578,742,0001,017,0002,117,632stderr
9Aug 28, 2026 15:159,61487,939,19178,762,0001,039,0002,117,632stderr