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 listMar 17, 2026 16:11Mikołaj UzarskiMikołaj UzarskiScore: 5,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 21:475,11465,705,90442,443,00002,289,664
2Feb 26, 2026 21:485,11565,584,70941,446,0001,010,0002,510,848
3Feb 26, 2026 21:485,11863,540,74641,472,0001,011,0002,510,848
4Feb 26, 2026 21:485,12172,055,93641,493,0001,012,0002,506,752
5Mar 17, 2026 16:115,12169,579,07240,480,0002,024,0002,277,376
6Feb 26, 2026 21:485,12968,962,06341,558,0001,013,0002,498,560
7Feb 26, 2026 21:485,13273,044,20941,584,0001,014,0002,289,664
8Mar 17, 2026 16:115,13875,998,94541,627,0001,015,0002,514,944
9Feb 26, 2026 21:485,14171,029,15841,654,0001,015,0002,289,664
10Mar 17, 2026 16:115,19662,544,19241,121,0002,005,0002,273,280
11Feb 26, 2026 21:475,37673,784,38743,609,0001,014,0002,510,848
12Feb 26, 2026 21:475,84671,689,87046,499,0002,021,0002,498,560