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 20, 2026 06:29M-RochatM-RochatScore: 41,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:3041,520354,203,045343,615,0001,003,0002,113,536
2May 20, 2026 06:3041,520352,584,372343,622,0001,002,0002,113,536
3May 20, 2026 06:3041,541354,722,258343,796,0001,002,0002,113,536
4May 20, 2026 06:3041,542363,671,434343,698,0001,101,0002,113,536
5May 20, 2026 06:3041,545353,050,341343,827,0001,004,0002,113,536
6May 20, 2026 06:3041,548352,535,918343,848,0001,002,0002,113,536
7May 20, 2026 06:3041,571370,650,624344,042,0001,005,0002,113,536
8May 20, 2026 06:3041,585360,489,608344,157,0001,004,0002,113,536
9May 20, 2026 06:3041,603361,868,223344,303,0001,002,0002,113,536