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 15, 2024 00:37zielajzielajScore: 4,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 00:374,00255,786,79432,207,0001,006,0002,359,296
2Nov 15, 2024 00:374,04658,346,17532,567,0001,017,0002,367,488
3Nov 15, 2024 00:374,05059,307,01032,595,0001,018,0002,281,472
4Nov 15, 2024 00:374,07860,039,14732,854,000995,0002,363,392
5Nov 15, 2024 00:374,23958,233,69034,182,0001,005,0002,359,296
6Nov 15, 2024 00:374,25357,009,74833,281,0002,017,0002,277,376