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 listOct 30, 2026 16:04Dinu GoyalDinu GoyalScore: 61,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2026 16:0561,230519,047,603449,447,00058,765,0002,113,536
2Oct 30, 2026 16:0561,255520,541,466449,651,00058,773,0002,113,536
3Oct 30, 2026 16:0561,273519,377,072449,509,00059,059,0002,113,536
4Oct 30, 2026 16:0561,287519,613,543449,646,00059,040,0002,113,536
5Oct 30, 2026 16:0561,294519,577,774449,406,00059,340,0002,113,536
6Oct 30, 2026 16:0561,349520,024,774450,519,00058,683,0002,113,536
7Oct 30, 2026 16:0561,351520,232,422449,411,00059,806,0002,113,536
8Oct 30, 2026 16:0561,396520,440,007450,996,00058,594,0002,113,536
9Oct 30, 2026 16:0561,399520,514,243450,489,00059,127,0002,113,536