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 listDec 29, 2025 10:32Aman | अमनAman | अमनScore: 72,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 10:2872,511631,389,575552,852,00048,986,0002,281,472
2Dec 29, 2025 10:2872,620624,284,135527,779,00074,968,0002,265,088
3Dec 29, 2025 10:2872,655626,026,699541,032,00062,003,0002,383,872
4Dec 29, 2025 10:2872,661627,140,625549,076,00054,007,0002,387,968
5Dec 29, 2025 10:2872,700633,830,525543,371,00060,041,0002,273,280
6Dec 29, 2025 10:2872,726626,430,700540,668,00062,961,0002,387,968
7Dec 29, 2025 10:2872,728630,948,944539,680,00063,962,0002,281,472
8Dec 29, 2025 10:3272,777632,477,817545,046,00059,005,0002,281,472
9Dec 29, 2025 10:3272,799636,841,634542,210,00062,024,0002,273,280
10Dec 29, 2025 10:2872,813632,981,873542,309,00062,035,0002,281,472
11Dec 29, 2025 10:2872,847626,472,123543,670,00060,963,0002,273,280
12Dec 29, 2025 10:3272,883624,816,298537,939,00066,992,0002,281,472