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 listOct 24, 2026 04:08Nao MinamiNao MinamiScore: 32,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:0832,290279,360,426267,011,0001,004,0002,113,536
2Oct 24, 2026 04:0832,296279,560,028267,061,0001,004,0002,113,536
3Oct 24, 2026 04:0832,298279,610,227266,067,0002,009,0002,113,536
4Oct 24, 2026 04:0832,299279,535,458266,080,0002,009,0002,113,536
5Oct 24, 2026 04:0832,301279,585,724266,071,0002,034,0002,113,536
6Oct 24, 2026 04:0832,308279,038,111266,119,0002,044,0002,113,536
7Oct 24, 2026 04:0832,314279,614,079267,201,0001,006,0002,113,536
8Oct 24, 2026 04:0832,315279,681,785266,206,0002,009,0002,113,536
9Oct 24, 2026 04:0832,321281,949,433266,255,0002,014,0002,117,632