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 listJul 14, 2026 20:58boop34boop34Score: 14,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:5914,348128,752,858118,038,0001,058,0002,113,536
2Jul 14, 2026 20:5914,355128,830,493118,095,0001,056,0002,113,536
3Jul 14, 2026 20:5914,357128,847,131118,111,0001,053,0002,113,536
4Jul 14, 2026 20:5914,387129,090,089118,326,0001,088,0002,113,536
5Jul 14, 2026 20:5914,619131,179,248120,280,0001,061,0002,113,536
6Jul 14, 2026 20:5914,665131,995,800120,654,0001,070,0002,113,536
7Jul 14, 2026 20:5914,669132,035,411120,683,0001,073,0002,113,536
8Jul 14, 2026 20:5914,688132,220,380120,845,0001,070,0002,113,536
9Jul 14, 2026 20:5914,750132,687,846121,358,0001,073,0002,113,536