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 31, 2025 21:15Adam FolwarcznyAdam FolwarcznyScore: 7,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 21:157,805100,762,79843,852,00020,929,0002,433,024
2Aug 31, 2025 21:157,82186,112,98650,933,00013,981,0002,416,640
3Aug 31, 2025 21:157,92388,563,76447,826,00017,934,0002,293,760
4Aug 31, 2025 21:157,96690,241,33448,083,00018,031,0002,531,328
5Aug 31, 2025 21:157,97392,489,96946,121,00020,052,0002,457,600
6Aug 31, 2025 21:157,97985,884,80950,168,00016,054,0002,359,296
7Aug 31, 2025 21:157,99890,625,34552,300,00014,081,0002,539,520
8Aug 31, 2025 21:158,00386,894,64253,338,00013,083,0002,281,472
9Aug 31, 2025 21:158,04090,156,13347,806,00018,923,0002,486,272
10Aug 31, 2025 21:158,06695,243,51448,962,00017,986,0002,539,520
11Aug 31, 2025 21:158,11491,601,32151,266,00016,083,0002,375,680
12Aug 31, 2025 21:158,14994,043,64254,512,00013,123,0002,281,472