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 16, 2026 06:37Haha ExpertHaha ExpertScore: 37,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 06:3737,679321,485,868311,740,0001,002,0002,117,632
2Sep 16, 2026 06:3737,702321,684,540311,930,0001,004,0002,117,632
3Sep 16, 2026 06:3737,704321,681,814311,944,0001,005,0002,117,632
4Sep 16, 2026 06:3737,704321,587,912311,941,0001,004,0002,117,632
5Sep 16, 2026 06:3737,705321,676,906311,950,0001,002,0002,117,632
6Sep 16, 2026 06:3737,706321,623,807311,965,0001,003,0002,117,632
7Sep 16, 2026 06:3737,707321,700,322311,967,0001,004,0002,117,632
8Sep 16, 2026 06:3737,711321,756,418312,003,0001,005,0002,117,632
9Sep 16, 2026 06:3737,715321,747,134312,032,0001,003,0002,117,632