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 listApr 21, 2026 10:02BenBenScore: 23,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 10:0223,610225,538,305186,969,0008,998,0002,326,528
2Apr 21, 2026 10:0223,621221,598,071187,056,0009,002,0002,322,432
3Apr 21, 2026 10:0223,628222,548,244188,109,0008,004,0002,322,432
4Apr 21, 2026 10:0223,645222,532,770187,243,0009,011,0002,342,912
5Apr 21, 2026 10:0223,651224,555,562189,299,0007,011,0002,326,528
6Apr 21, 2026 10:0223,656216,499,627187,334,0009,016,0002,322,432
7Apr 21, 2026 10:0223,697226,574,514187,703,0008,985,0002,326,528
8Apr 21, 2026 10:0223,773229,429,662187,308,00010,016,0002,273,280
9Apr 21, 2026 10:0223,889223,536,650189,271,0009,012,0002,322,432