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 4, 2026 10:42LatentSearchLatentSearchScore: 7,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 10:437,09367,285,26956,812,0002,068,0002,117,632
2Aug 4, 2026 10:437,09767,285,88756,772,0002,140,0002,117,632
3Aug 4, 2026 10:437,10367,288,45356,886,0002,070,0002,117,632
4Aug 4, 2026 10:437,10667,363,55856,921,0002,059,0002,117,632
5Aug 4, 2026 10:437,10867,466,62456,940,0002,059,0002,117,632
6Aug 4, 2026 10:437,10967,460,03156,918,0002,092,0002,117,632
7Aug 4, 2026 10:437,12367,514,22957,050,0002,074,0002,117,632
8Aug 4, 2026 10:437,14367,506,61557,125,0002,165,0002,117,632
9Aug 4, 2026 10:437,16267,850,87357,354,0002,093,0002,117,632