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 1, 2026 07:10Md Nafis Ul Haque ShifatMd Nafis Ul Haque ShifatScore: 6,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2026 07:106,49764,606,13450,871,0003,057,0002,113,536
2Nov 1, 2026 07:106,52064,813,59452,059,0002,063,0002,113,536
3Nov 1, 2026 07:106,53064,956,61651,183,0003,017,0002,113,536
4Nov 1, 2026 07:106,53265,915,08952,080,0002,140,0002,113,536
5Nov 1, 2026 07:106,54365,018,25552,253,0002,060,0002,113,536
6Nov 1, 2026 07:106,54765,097,97652,287,0002,060,0002,113,536
7Nov 1, 2026 07:106,55166,351,87551,256,0003,120,0002,113,536
8Nov 1, 2026 07:106,59665,456,24551,700,0003,049,0002,113,536
9Nov 1, 2026 07:106,60265,560,26051,675,0003,129,0002,113,536