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 2, 2026 11:29Andrey TsvetkovAndrey TsvetkovScore: 93,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:3193,894790,076,082776,139,0003,187,0002,138,112
2Aug 2, 2026 11:3193,909790,772,627776,449,0003,002,0002,138,112
3Aug 2, 2026 11:3193,916790,642,813776,506,0003,002,0002,138,112
4Aug 2, 2026 11:3193,917790,719,727776,496,0003,018,0002,138,112
5Aug 2, 2026 11:3193,918791,040,105776,518,0003,003,0002,138,112
6Aug 2, 2026 11:3193,918789,233,225776,522,0003,002,0002,138,112
7Aug 2, 2026 11:3193,922790,659,598776,556,0003,003,0002,138,112
8Aug 2, 2026 11:3193,929795,313,867776,608,0003,006,0002,138,112
9Aug 2, 2026 11:3194,143793,498,843778,368,0003,025,0002,138,112