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 30, 2025 21:17Adam FolwarcznyAdam FolwarcznyScore: 10,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2025 21:1710,258116,329,48852,469,00032,669,0002,494,464
2Aug 30, 2025 21:1710,293112,231,25048,675,00036,755,0002,449,408
3Aug 30, 2025 21:1710,297111,596,42750,681,00034,781,0002,433,024
4Aug 30, 2025 21:1710,305114,463,08051,120,00034,408,0002,502,656
5Aug 30, 2025 21:1710,309112,740,87249,174,00036,389,0002,486,272
6Aug 30, 2025 21:1710,330108,824,25544,347,00041,391,0002,494,464
7Aug 30, 2025 21:1710,335107,430,76548,315,00037,469,0002,506,752
8Aug 30, 2025 21:1710,364117,122,80552,402,00033,616,0002,494,464
9Aug 30, 2025 21:1710,377115,954,72751,481,00034,650,0002,289,664
10Aug 30, 2025 21:1710,475116,476,53251,375,00035,567,0002,506,752
11Aug 30, 2025 21:1710,535112,763,79850,677,00036,765,0002,310,144
12Aug 30, 2025 21:1710,828116,143,04657,281,00032,591,0002,486,272