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 listSep 15, 2026 19:47C21C21Score: 12,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 19:4812,279112,269,889100,748,0001,170,0002,113,536
2Sep 15, 2026 19:4812,286112,365,702100,743,0001,239,0002,113,536
3Sep 15, 2026 19:4812,297112,894,391100,809,0001,258,0002,113,536
4Sep 15, 2026 19:4812,302112,449,108100,941,0001,166,0002,113,536
5Sep 15, 2026 19:4812,305112,539,337101,027,0001,111,0002,113,536
6Sep 15, 2026 19:4812,310112,611,195101,170,0001,006,0002,113,536
7Sep 15, 2026 19:4812,315112,621,812100,962,0001,257,0002,113,536
8Sep 15, 2026 19:4812,319112,688,679101,003,0001,249,0002,113,536
9Sep 15, 2026 19:4812,372113,015,391101,537,0001,154,0002,113,536