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 listOct 14, 2024 16:25Joad NacerJoad NacerScore: 4,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:254,63758,024,51937,476,0001,012,0002,535,424
2Oct 14, 2024 16:254,66064,023,58537,657,0001,017,0002,535,424
3Oct 14, 2024 16:254,66366,574,06337,681,0001,018,0002,531,328
4Oct 14, 2024 16:254,80365,621,73637,868,0001,993,0002,531,328
5Oct 14, 2024 16:254,83062,259,85339,091,0001,002,0002,531,328
6Oct 14, 2024 16:254,86369,893,10937,333,0003,027,0002,506,752