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 listMar 27, 2026 21:04BrillentypBrillentypScore: 87,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 21:0487,554754,475,334584,759,000141,941,0002,289,664
2Mar 27, 2026 21:0487,613757,282,946591,155,000136,035,0002,281,472
3Mar 27, 2026 21:0487,616750,787,363573,380,000153,833,0002,535,424
4Mar 27, 2026 21:0487,791754,355,975584,734,000143,934,0002,506,752
5Mar 27, 2026 21:0487,804758,725,205579,817,000148,953,0002,277,376
6Mar 27, 2026 21:0487,804757,364,711579,820,000148,953,0002,277,376
7Mar 27, 2026 21:0487,812755,602,430558,880,000169,963,0002,277,376
8Mar 27, 2026 21:0487,821760,973,101574,933,000153,982,0002,355,200
9Mar 27, 2026 21:0487,961757,062,182577,062,000153,016,0002,289,664