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 17:23zielajzielajScore: 3,466Success
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 17:243,40444,838,43928,259,00002,424,832
2Apr 26, 2026 17:243,41640,990,70927,344,0001,012,0002,424,832
3Apr 26, 2026 17:243,45447,949,18227,649,0001,024,0002,424,832
4Apr 26, 2026 17:243,45547,038,44127,658,0001,024,0002,310,144
5Apr 26, 2026 17:243,46642,944,59526,787,0001,984,0002,420,736
6Apr 26, 2026 17:243,46941,670,88326,812,0001,986,0002,494,464
7Apr 26, 2026 17:243,47249,204,92026,834,0001,987,0002,424,832
8Apr 26, 2026 17:243,48050,271,56926,898,0001,992,0002,416,640
9Apr 26, 2026 17:243,53748,363,48329,360,00002,420,736