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 listApr 26, 2026 16:15wnwnScore: 3,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:163,41048,259,01127,294,0001,010,0002,490,368
2Apr 26, 2026 16:163,43848,861,18427,524,0001,019,0002,482,176
3Apr 26, 2026 16:163,45144,364,93927,621,0001,023,0002,482,176
4Apr 26, 2026 16:163,45847,660,15027,680,0001,025,0002,490,368
5Apr 26, 2026 16:163,49541,746,94327,013,0002,000,0002,330,624
6Apr 26, 2026 16:163,50243,691,06027,068,0002,005,0002,490,368
7Apr 26, 2026 16:163,58949,928,25028,763,0001,027,0002,486,272
8Apr 26, 2026 16:163,63248,693,33028,141,0002,010,0002,494,464
9Apr 26, 2026 16:163,63751,724,68829,185,0001,006,0002,486,272