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 22, 2025 20:57Adam FolwarcznyAdam FolwarcznyScore: 17,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 20:5717,147164,708,367141,322,0001,002,0002,281,472
2Aug 22, 2025 20:5717,149162,820,189141,333,0001,002,0002,449,408
3Aug 22, 2025 20:5717,150162,036,486141,340,0001,002,0002,531,328
4Aug 22, 2025 20:5717,151165,158,049141,349,0001,002,0002,531,328
5Aug 22, 2025 20:5717,151165,931,299141,350,0001,002,0002,531,328
6Aug 22, 2025 20:5717,151162,768,306141,348,0001,002,0002,441,216
7Aug 22, 2025 20:5717,152167,337,098141,363,0001,002,0002,437,120
8Aug 22, 2025 20:5717,152164,988,104141,358,0001,002,0002,531,328
9Aug 22, 2025 20:5717,157167,247,458141,403,0001,002,0002,437,120