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 listNov 19, 2025 13:42PinKodPinKodScore: 395,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2025 13:42394,2883,304,381,1413,208,616,00063,972,0002,289,664
2Nov 19, 2025 13:42394,4263,307,601,9403,207,740,00065,994,0002,281,472
3Nov 19, 2025 13:42394,5063,303,591,4273,200,435,00073,963,0002,289,664
4Nov 19, 2025 13:42394,7043,304,595,7243,202,091,00073,955,0002,519,040
5Nov 19, 2025 13:42395,0713,302,636,3183,198,135,00080,952,0002,510,848
6Nov 19, 2025 13:42395,1343,308,035,3893,211,642,00067,971,0002,281,472
7Nov 19, 2025 13:42396,7873,318,164,9873,225,368,00067,965,0002,506,752
8Nov 19, 2025 13:42398,2433,336,251,8013,232,472,00072,942,0002,281,472
9Nov 19, 2025 13:42399,9663,351,712,6343,258,739,00060,976,0002,289,664