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 listMay 7, 2026 10:16wnwnScore: 3,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:173,37442,875,33126,968,0001,043,0002,498,560
2May 7, 2026 10:173,39345,172,36127,083,0001,083,0002,482,176
3May 7, 2026 10:173,39646,895,69827,089,0001,104,0002,490,368
4May 7, 2026 10:173,39642,991,52727,129,0001,066,0002,482,176
5May 7, 2026 10:173,40146,758,03027,165,0001,068,0002,490,368
6May 7, 2026 10:173,51342,526,38228,089,0001,076,0002,482,176
7May 7, 2026 10:173,59043,704,14028,724,0001,079,0002,494,464
8May 7, 2026 10:173,60344,919,23828,837,0001,073,0002,486,272
9May 7, 2026 10:173,61545,023,96228,929,0001,076,0002,490,368