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:32Adam FolwarcznyAdam FolwarcznyScore: 9,924Success
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:329,639103,879,75345,434,00034,569,0002,424,832
2Aug 30, 2025 21:329,845108,326,44744,844,00036,871,0002,416,640
3Aug 30, 2025 21:329,868107,722,97152,302,00029,605,0002,433,024
4Aug 30, 2025 21:329,884119,163,04646,453,00035,581,0002,424,832
5Aug 30, 2025 21:329,884111,305,01348,432,00033,605,0002,416,640
6Aug 30, 2025 21:329,894109,837,76150,459,00031,661,0002,510,848
7Aug 30, 2025 21:329,924107,776,56449,620,00032,749,0002,416,640
8Aug 30, 2025 21:329,933107,602,48547,681,00034,767,0002,506,752
9Aug 30, 2025 21:329,957120,400,52048,208,00034,434,0002,338,816
10Aug 30, 2025 21:329,985111,536,16055,248,00027,624,0002,334,720
11Aug 30, 2025 21:329,996109,317,65051,359,00031,605,0002,416,640
12Aug 30, 2025 21:3210,156106,779,00847,602,00036,693,0002,416,640