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 15, 2025 09:33Pavitra GolchhaPavitra GolchhaScore: 366,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 09:33319,1722,679,086,7442,592,148,00056,981,0002,285,568
2Dec 15, 2025 09:33358,0542,998,786,5512,897,876,00073,971,0002,281,472
3Dec 15, 2025 09:33364,9413,052,734,8982,953,036,00075,975,0002,355,200
4Dec 15, 2025 09:33365,5713,063,074,5892,967,276,00066,961,0002,281,472
5Dec 15, 2025 09:33366,6623,073,471,2442,974,333,00068,961,0002,285,568
6Dec 15, 2025 09:33367,1373,072,643,5732,970,281,00076,955,0002,281,472
7Dec 15, 2025 09:33367,8513,084,862,5982,988,205,00064,960,0002,363,392
8Dec 15, 2025 09:33372,2433,113,132,3713,020,644,00068,969,0002,465,792
9Dec 15, 2025 09:33373,0233,121,616,1143,023,109,00072,978,0002,285,568