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 1, 2026 18:56TonyTonyScore: 56,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 18:5656,848482,003,767412,533,00059,313,0002,113,536
2Aug 1, 2026 18:5656,868482,946,310413,004,00059,004,0002,113,536
3Aug 1, 2026 18:5656,889482,614,537412,615,00059,570,0002,113,536
4Aug 1, 2026 18:5656,897482,460,539412,962,00059,286,0002,113,536
5Aug 1, 2026 18:5656,920482,696,480412,960,00059,483,0002,113,536
6Aug 1, 2026 18:5656,932482,704,714412,979,00059,557,0002,113,536
7Aug 1, 2026 18:5656,937483,483,871412,975,00059,609,0002,113,536
8Aug 1, 2026 18:5656,938483,583,444412,942,00059,646,0002,113,536
9Aug 1, 2026 18:5656,941482,710,085412,947,00059,668,0002,113,536