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 17, 2026 01:59M-RochatM-RochatScore: 12,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:0012,614115,615,556102,520,0002,177,0002,113,536
2May 17, 2026 02:0012,638114,332,303102,714,0002,182,0002,113,536
3May 17, 2026 02:0012,656115,999,657102,805,0002,240,0002,113,536
4May 17, 2026 02:0012,657114,039,056102,877,0002,184,0002,113,536
5May 17, 2026 02:0012,658116,089,159102,839,0002,223,0002,113,536
6May 17, 2026 02:0012,661114,562,138102,870,0002,217,0002,113,536
7May 17, 2026 02:0012,662115,587,106102,840,0002,257,0002,113,536
8May 17, 2026 02:0012,666116,757,970102,966,0002,164,0002,113,536
9May 17, 2026 02:0012,685114,740,558102,059,0003,231,0002,113,536