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 listSep 24, 2026 12:24wnwnScore: 3,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 12:303,29536,098,84226,310,0001,041,0002,113,536
2Sep 24, 2026 12:303,32436,266,45326,554,0001,042,0002,113,536
3Sep 24, 2026 12:303,36136,544,06326,861,0001,042,0002,113,536
4Sep 24, 2026 12:303,46538,166,22227,731,0001,032,0002,113,536
5Sep 24, 2026 12:303,47238,240,78827,787,0001,032,0002,113,536
6Sep 24, 2026 12:303,49738,515,13928,012,0001,014,0002,113,536
7Sep 24, 2026 12:304,50548,880,81128,076,0009,322,0002,113,536
8Sep 24, 2026 12:304,73848,014,33428,188,00011,139,0002,113,536
9Sep 24, 2026 12:305,04751,331,17928,284,00013,608,0002,113,536