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 listMay 9, 2026 23:52Andrii StolitniiAndrii StolitniiScore: 86,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:5285,927727,923,222651,183,00062,012,0002,351,104
2May 9, 2026 23:5285,991733,398,681651,216,00062,514,0002,351,104
3May 9, 2026 23:5286,025732,861,988651,436,00062,573,0002,351,104
4May 9, 2026 23:5286,076733,635,988651,268,00063,171,0002,363,392
5May 9, 2026 23:5286,129729,454,967652,070,00062,806,0002,347,008
6May 9, 2026 23:5286,151733,947,576652,615,00062,439,0002,355,200
7May 9, 2026 23:5286,242733,909,601652,282,00063,529,0002,351,104
8May 9, 2026 23:5286,304734,139,778652,307,00064,019,0002,355,200
9May 9, 2026 23:5286,334732,628,021652,502,00064,074,0002,363,392