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 listNov 2, 2025 02:59Tan Lip WeiTan Lip WeiScore: 40,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 03:0040,078366,146,413321,662,00010,988,0002,355,200
2Nov 2, 2025 03:0040,099359,721,915323,828,0008,995,0002,338,816
3Nov 2, 2025 03:0040,128356,592,401323,059,00010,001,0002,473,984
4Nov 2, 2025 02:5940,154362,468,716324,298,0008,980,0002,379,776
5Nov 2, 2025 02:5940,158363,161,660320,339,00012,973,0002,314,240
6Nov 2, 2025 02:5940,272363,871,746323,248,00011,008,0002,260,992