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 2, 2026 12:20Keshav BansalKeshav BansalScore: 105,762Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Nov 2, 2026 14:17Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 12:20105,326885,042,759642,614,000231,592,00024,576
2Nov 2, 2026 12:20105,762889,435,281644,314,000233,513,0002,117,632
3Nov 2, 2026 12:20105,956890,314,076647,260,000232,175,0002,117,632