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 listApr 28, 2024 15:30Steve HanSteve HanScore: 20,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 15:3120,450223,569,528169,737,23402,174,976
2Apr 28, 2024 15:3120,450226,678,722169,731,01202,289,664
3Apr 28, 2024 15:3120,500227,215,687170,153,15802,301,952
4Apr 28, 2024 15:3020,541239,059,929170,489,70502,301,952
5Apr 28, 2024 15:3120,542252,927,219170,497,68502,301,952
6Apr 28, 2024 15:3020,560239,164,331170,651,49202,170,880
7Apr 28, 2024 15:3020,596241,408,020170,944,61402,297,856
8Apr 28, 2024 15:3120,633253,692,098171,250,59502,301,952
9Apr 28, 2024 15:3120,704247,210,101171,847,03502,301,952